Three realization problems about univariate polynomials

TL;DR

This paper investigates three realization problems for univariate polynomials, exploring conditions under which certain sign patterns and root configurations are achievable, with a focus on degree 4 polynomials and minimal degrees for non-realizability.

Contribution

It introduces new results on the realizability of sign patterns and root configurations, including the minimal degree for non-realizable tuples and geometric interpretations for degree 4.

Findings

6 is the smallest degree with non-realizable tuples

Characterization of realizable sign patterns and root counts

Geometric interpretation for degree 4 polynomials

Abstract

We consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial $P:=\sum_{j=0}^db_jx^j$ defines the sign pattern $\sigma (P):=({\rm sgn}(b_d)$, $\ldots$, ${\rm sgn}(b_0))$. The numbers $p_d$ and $n_d$ of positive and negative roots of $P$ (counted with multiplicity) satisfy the Descartes' rule of signs. Problem~1 asks for which couples $C$ of the form (sign pattern $\sigma$, pair $(p_d,n_d)$ compatible with $\sigma$ in the sense of Descartes' rule of signs), there exist polynomials $P$ defining these couples. Problem~2 asks for which $d$-tuples of pairs $T:=((p_d,n_d)$, $\ldots$, $(p_1,n_1))$, there exist polynomials $P$ such that $P^{(d-j)}$ has $p_j$ positive and $n_j$ negative roots. A $d$-tuple $T$ determines the sign pattern $\sigma (P)$, but the inverse is false. We show by an example that $6$ is the smallest value of $d$ for which there exist non-realizable tuples $T$ for which the corresponding couples $C$ are realizable. The third problem concerns polynomials with all roots real. We give a geometric interpretation of the three problems in the context of degree $4$ polynomials.