Three realization problems about univariate polynomials

Abstract

We consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial P:=Σj=0dbjxj defines the sign pattern σ (P):=( sgn(bd), …, sgn(b0)). The numbers pd and nd 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 σ, pair (pd,nd) compatible with σ 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:=((pd,nd), …, (p1,n1)), there exist polynomials P such that P(d-j) has pj positive and nj negative roots. A d-tuple T determines the sign pattern σ (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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…