On μ-symmetric polynomials
DOI10.1142/S0219498822502334zbMath1506.12001arXiv2001.07403OpenAlexW3199401616MaRDI QIDQ5046095
Publication date: 27 October 2022
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.07403
symmetric functionmultiple roots\(\mu\)-ideal\(\mu\)-symmetric polynomial\(D\)-plus discriminantgist polynomiallift polynomial
Symbolic computation and algebraic computation (68W30) Symmetric functions and generalizations (05E05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational methods for problems pertaining to field theory (12-08)
Uses Software
Cites Work
- On \(\mu\)-symmetric polynomials and D-plus
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Complexity Analysis of Root Clustering for a Complex Polynomial
- Algorithms in real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On μ-symmetric polynomials