Stratifying Discriminant Hypersurface
Preprint
Abstract
This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on subdiscriminants. The first approach stratifies the discriminant hypersurface by recursively removing all the lowest-order points, while the second one stratifies the discriminant hypersurface by recursively removing all the smooth points. Both approaches rely solely on the discriminant itself instead of using high-order subdiscriminants. These results offer new insights into the intrinsic geometry of the discriminant and its connection to root multiplicity.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Parametric “non-nested” discriminants for multiplicities of univariate polynomialsScience China Mathematics, 2024
- Multivariate discriminant and iterated resultantActa Mathematica Sinica, English Series, 2016
- Duality of multiple root lociJournal of Algebra, 2016
- On Solving Parametric Polynomial SystemsMathematics in Computer Science, 2012
- Some remarks on equations defining coincident root lociJournal of Algebra, 2012
- Solving parametric polynomial systemsJournal of Symbolic Computation, 2007
- An Algorithm for Isolating the Real Solutions of Semi-algebraic SystemsJournal of Symbolic Computation, 2002
- A complete algorithm for automated discovering of a class of inequality-type theoremsScience China Information Sciences, 2001
- Recent Advances on Determining the Number of Real Roots of Parametric PolynomialsJournal of Symbolic Computation, 1999
- Multivariate subresultantsJournal of Pure and Applied Algebra, 1995