Abstract
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be written as conjunctions of several polynomial equalities and one inequality in the coefficients. Those polynomials in the coefficients are called discriminants for multiplicities. It is also known that discriminants can be obtained by using repeated parametric gcd’s. The resulting discriminants are usually nested determinants, i.e., determinants of matrices whose entries are determinants, and so on. In this paper, we give a new type of discriminants which are not based on repeated gcd’s. The new discriminants are simpler in the sense that they are non-nested determinants and have smaller maximum degrees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Basu S, Pollack R, Roy M-F. Algorithms in Real Algebraic Geometry. Berlin-Heidelberg: Springer-Verlag, 2006
Bóna M. A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory, 4th ed. Singapore: World Sci Publ, 2016
Brown W, Traub J. On Euclid’s algorithm and the theory of subresultants. J ACM, 1971, 18: 505–514
Collins G. Subresultants and reduced polynomial remainder sequences. J ACM, 1967, 14: 128–142
González-Vega L, Recio T, Lombardi H, et al. Sturm-Habicht sequences, determinants and real roots of univariate polynomials. In: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Vienna: Springer, 1998, 300–316
Hong H, Yang J. A condition for multiplicity structure of univariate polynomials. arXiv:2001.02388, 2020
Hong H, Yang J. A condition for multiplicity structure of univariate polynomials. J Symbolic Comput, 2021, 104: 523–538
Liang S, Jeffrey D J. An algorithm for computing the complete root classification of a parametric polynomial. In: Proceedings of the Artificial Intelligence and Symbolic Computation. Lecture Notes in Computer Science, vol. 4120. Berlin-Heidelberg: Springer, 2006, 116–130
Liang S, Jeffrey D J, Maza M M. The complete root classification of a parametric polynomial on an interval. In: Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation. New York: ACM, 2008, 189–196
Liang S, Zhang J. A complete discrimination system for polynomials with complex coefficients and its automatic generation. Sci China Ser E, 1999, 42: 113–128
Loos R. Generalized polynomial remainder sequences. In: Computer Algebra. Computing Supplementa (Computing), vol. 4. Vienna: Springer, 1983, 115–137
Stoer J, Bulirsch R. Interpolation. In: Introduction to Numerical Analysis. Texts in Applied Mathematics, vol. 12. New York: Springer, 2002, 37–144
Yang L, Hou X, Zeng Z. A complete discrimination system for polynomials. Sci China Ser E, 1996, 39: 628–646
Acknowledgements
Hoon Hong was supported by National Science Foundations of USA (Grant Nos. 2212461 and 1813340). Jing Yang was supported by National Natural Science Foundation of China (Grant Nos. 12261010 and 11801101).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hong, H., Yang, J. Parametric “non-nested” discriminants for multiplicities of univariate polynomials. Sci. China Math. (2024). https://doi.org/10.1007/s11425-023-2143-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11425-023-2143-3