@inproceedings{2a66460b929b456681bae79e8e5294da,

title = "On μ -Symmetric Polynomials and D-Plus",

abstract = "We study functions of the roots of a univariate polynomial of degree n≥ 1 in which the roots have a given multiplicity structure μ, denoted by a partition of n. For this purpose, we introduce a theory of μ -symmetric polynomials which generalizes the classic theory of symmetric polynomials. We designed three algorithms for checking if a given root function is μ -symmetric: one based on Gr{\"o}bner bases, another based on preprocessing and reduction, and the third based on solving linear equations. Experiments show that the latter two algorithms are significantly faster. We were originally motivated by a conjecture about the μ -symmetry of a certain root function D+(μ) called D-plus. This conjecture is proved to be true. But prior to the proof, we studied the conjecture experimentally using our algorithms.",

author = "Jing Yang and Yap, {Chee K.}",

year = "2018",

doi = "10.1007/978-3-319-96418-8_57",

language = "English (US)",

isbn = "9783319964171",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "482--491",

editor = "Davenport, {James H.} and George Labahn and Josef Urban and Manuel Kauers",

booktitle = "Mathematical Software – ICMS 2018 - 6th International Conference, Proceedings",

note = "6th International Conference on Mathematical Software, ICMS 2018 ; Conference date: 24-07-2018 Through 27-07-2018",

}