Math-1841 · mathematics · Algebra

Math-1841

Problems Around Polynomials — Problem 5

Status Partially solved · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedPartially solvedOpen

Statement

Definitions and mathematical statement

Fix a degree $d\geq1$ and a sign pattern $\sigma=(\sigma_0,\ldots,\sigma_d)\in\{+,-\}^{d+1}$, read from the leading coefficient down to the constant term. Let $c(\sigma)$ be the number of changes between consecutive signs and let $s(\sigma)=d-c(\sigma)$ be the number of preservations. An ordered pair $(u,v)$ of nonnegative integers is admissible when \[ u\leq c(\sigma),\quad u\equiv c(\sigma)\pmod2,\qquad v\leq s(\sigma),\quad v\equiv s(\sigma)\pmod2. \]

Call this pair realizable if there is a real polynomial $P(x)=a_0x^d+a_1x^{d-1}+\cdots+a_d$, with every coefficient nonzero and $\operatorname{sign}(a_j)=\sigma_j$, having exactly $u$ positive and $v$ negative real roots, counted with algebraic multiplicities. Its remaining $d-u-v$ roots must be nonreal and occur in conjugate pairs; zero itself cannot be a root because $a_d\ne0$.

Determine, for every sign pattern in every degree, precisely which admissible pairs are realizable. The displayed conditions are the necessary restrictions coming from applying Descartes' rule to $P(x)$ and $P(-x)$; the problem is to characterize any additional obstructions. A solution should supply realizations for the allowed pairs as well as proofs of impossibility for excluded pairs. The classification includes pairs with either coordinate zero and pairs with both coordinates positive. No claim that either of these subclasses is automatically realizable is built into the question.

Short English statement

Which positive and negative root counts can occur for a specified pattern of coefficient signs?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.