Optimality of Curtiss Bound on Poincare Multiplier for Positive Univariate Polynomials

preprint2023arXivOpen access

Abstract

Let ff be a monic univariate polynomial with non-zero constant term. We say that ff is positive if f(x)f(x) is positive over all x≥0x\geq0. If all the coefficients of ff are non-negative, then ff is trivially positive. In 1883, Poincaré proved thatff is positive if and only if there exists a monic polynomial gg such that all the coefficients of gfgf are non-negative. Such polynomial gg is called a Poincaré multiplier for the positive polynomial ff. Of course one hopes to find a multiplier with smallest degree. This naturally raised a challenge: find an upper bound on the smallest degree of multipliers. In 1918, Curtiss provided such a bound. Curtiss also showed that the bound is optimal (smallest) when degree of ff is 1 or 2. It is easy to show that the bound is not optimal when degree of ff is higher. The Curtiss bound is a simple expression that depends only on the angle (argument) of non-real roots of ff. In this paper, we show that the Curtiss bound is optimal among all the bounds that depends only on the angles.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.