[Paper Review] Something You Always Wanted to Know About Real Polynomials (But Were Afraid to Ask)

Vladimir Petrov Kostov, Boris Shapiro|arXiv (Cornell University)|Mar 13, 2017

Mathematics and Applications8 references3 citations

TL;DR

This paper investigates the realizability of sign patterns and root configurations in real univariate polynomials, extending Descartes' rule of signs by identifying new non-realizable combinations. Using geometric and algebraic techniques on discriminant loci and root configurations, the authors discover an infinite family of non-realizable sign pattern–root count pairs, resolving long-standing questions about the limitations of Descartes' rule beyond low degrees.

ABSTRACT

The famous Descartes' rule of signs from 1637 giving an upper bound on the number of positive roots of a real univariate polynomials in terms of the number of sign changes of its coefficients, has been an indispensable source of inspiration for generations of mathematicians. Trying to extend and sharpen this rule, we consider below the set of all real univariate polynomials of a given degree, a given collection of signs of their coefficients, and a given number of positive and negative roots. In spite of the elementary definition of the main object of our study, it is a non-trivial question for which sign patterns and numbers of positive and negative roots the corresponding set is non-empty. The main result of the present paper is a discovery of a new infinite family of non-realizable combinations of sign patterns and the numbers of positive and negative roots.

Motivation & Objective

• To determine which combinations of sign patterns and prescribed numbers of positive and negative roots are realizable by real univariate polynomials.
• To extend Descartes' rule of signs by identifying cases where admissible root counts are not geometrically realizable.
• To resolve open problems on realizability of root configurations under sign pattern constraints, particularly beyond degree 4.
• To explore the topological structure of polynomial spaces via discriminant loci and root configuration domains.
• To investigate path-connectedness of solution sets for given sign patterns and root counts, addressing deeper structural questions in real algebraic geometry.

Proposed method

• Analyzes the space of monic real polynomials of degree d with non-vanishing coefficients, focusing on sign patterns and their associated Descartes' pairs.
• Uses the standard Z2×Z2 action (reversal and reciprocal transformation) to reduce the number of distinct cases under symmetry.
• Applies geometric analysis of the discriminant locus Φ in coefficient space to study root multiplicity and configuration transitions.
• Examines intersections of the discriminant locus with planes parallel to the (b,c)-plane to classify regions with 4, 2, or 0 real roots.
• Identifies critical values (e.g., a = 3/8) where the topology of root configuration domains changes, marking transitions between real and complex conjugate roots.
• Employs algebraic constraints (e.g., b < s, bt < cs, b² ≥ 4c, s² < 4t) to prove non-realizability of specific root-count pairs under given sign patterns.

Experimental results

Research questions

• RQ1 Which combinations of sign patterns and prescribed numbers of positive and negative roots are realizable by real univariate polynomials?
• RQ2 Are there non-realizable root configurations that satisfy Descartes' rule of signs but cannot be realized by any polynomial with the given sign pattern?
• RQ3 How do the topological structures of root configuration domains (H4, H2, H0) in coefficient space relate to sign patterns and discriminant loci?
• RQ4 Is the set of polynomials realizing a given sign pattern and root count pair path-connected?
• RQ5 Which sequences of positive and negative root counts across derivatives of a polynomial are realizable?

Key findings

• An infinite family of non-realizable combinations of sign patterns and root counts is discovered, extending beyond previously known exceptions.
• For degree 4, the sign pattern (+,−,−,−,+) does not realize the pair (0,2), and (+,+,−,+,+) does not realize (2,0), both with Descartes' pair (2,2).
• For degree 5, the sign pattern (1,−,−,−,−,+) does not realize (0,3), up to the standard Z2×Z2 action.
• For degree 6, non-realizable combinations include (1,−,−,−,−,−,+) with (0,2) and (0,4), and (1,+,+,+,-,+,+) with (2,0).
• For degree 7, exactly six non-realizable combinations exist under the Z2×Z2 action, including (1,+,−,−,−,−,−,+) with (0,5) and (1,+,−,+,−,−,−,−) with (3,0).
• For degree 8, the number of non-realizable combinations increases significantly, with 3648 total combinations considered, though specific non-realizable cases are not fully listed in the provided text.