On -symmetric polynomials

DOI10.1142/S0219498822502334MaRDI QIDQ5046095zbMATH OpenOpenAlexFDO

Authors Jing Yang, Chee K. Yap

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

zbMATH Keywords

\(\mu\)-ideal\(\mu\)-symmetric polynomial\(D\)-plus discriminantgist polynomiallift polynomialmultiple rootssymmetric function

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Computational methods for problems pertaining to field theory (12-08) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Abstract: In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory to $mu$-symmetric polynomials. We were motivated by a conjecture from Becker et al.~(ISSAC 2016) about the $mu$-symmetry of a particular root function $D^{+}(mu)$, called D-plus. To investigate this conjecture, it was desirable to have fast algorithms for checking if a given root function is $mu$-symmetric. We designed three such algorithms: one based on Gr"{o}bner bases, another based on preprocessing and reduction, and the third based on solving linear equations. We implemented them in Maple and experiments show that the latter two algorithms are significantly faster than the first.

Recommendations

• On \(\mu\)-symmetric polynomials and D-plus
• scientific article; zbMATH DE number 3975060
• Symmetric Functions, m-Sets, and Galois Groups
• scientific article; zbMATH DE number 4191832
• Symmetric functions and root-finding algorithms

Cites work

• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Algorithms in real algebraic geometry
• Complexity Analysis of Root Clustering for a Complex Polynomial
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• On \(\mu\)-symmetric polynomials and D-plus

Cited in

(10)

• Milne's volume function and vector symmetric polynomials
• On \(\mu\)-symmetric polynomials and D-plus
• Note on separately symmetric polynomials on the Cartesian product of \(\ell_1\)
• scientific article; zbMATH DE number 5850846 (Why is no real title available?)
• Unimodal Polynomials Arising from Symmetric Functions
• scientific article; zbMATH DE number 3975060 (Why is no real title available?)
• On Nonnegativity of Symmetric Polynomials
• scientific article; zbMATH DE number 1060789 (Why is no real title available?)
• Symmetric polynomials, generalized Jacobi-Trudi identities and τ-functions
• On symmetric Tetranacci polynomials in mathematics and physics

Describes a project that uses

Uses Software

• Maple

This page was built for publication: On \(\mu\)-symmetric polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046095)