On μ-symmetric polynomials

DOI10.1142/S0219498822502334zbMATH Open1506.12001arXiv2001.07403OpenAlexW3199401616MaRDI QIDQ5046095

Author name not available (Why is that?)

Publication date: 27 October 2022

Published in: (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2001.07403

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: On μ-symmetric polynomials

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