Related papers: Stubborn Polynomials

We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…

We investigate structural properties of the cone of roots of relative Steiner polynomials of convex bodies. We prove that they are closed, monotonous with respect to the dimension, and that they cover the whole upper half-plane, except the…

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Let $Z\subset{\bf P}^{n-1}$ be a hypersurface such that the associated reduced hypersurface $Z_{\rm red}$ has only weighted homogeneous isolated singularities. In the case $Z$ is a reduced curve or $Z_{\rm red}$ has only homogeneous…

In any cubic polynomial, the average of the slopes at the $3$ roots is the negation of the slope at the average of the roots. In any quartic, the average of the slopes at the $4$ roots is twice the negation of the slope at the average of…

We ask whether every polynomial function that is non-negative on a real algebraic curve can be expressed as a sum of squares in the coordinate ring. Scheiderer has classified all irreducible curves for which this is the case. For reducible…

In the smallest cases where there exist nonnegative polynomials that are not sums of squares we present a complete explanation of this distinction. The fundamental reason that the cone of sums of squares is strictly contained in the cone of…

We provide explicit conditions for a real polynomial $f$ of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of $f$, i.e. with no lifting. All conditions are simple and provide an explicit description of a…

Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

For fixed degree and increasing number of variables the dimension of the vector space of $n$-variate real symmetric homogeneous polynomials (forms) of degree $d$ stabilizes. We study the limits of the cones of symmetric nonnegative…

We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…

We study the cone of non-negative polynomials on generalized elliptic curves. We show that the zero set of every extreme ray has dense real points. If a generalized elliptic curve is embedded via a complete linear system, then we show that…

Let $f \in \mathbb{R}[x]$ be a polynomial with real coefficients. We say that $f$ is eventually non-negative if $f^m$ has non-negative coefficients for all sufficiently large $m \in \mathbb{N}$. In this short note, we give a classification…

This article deals with a quantitative aspect of Hilbert's seventeenth problem: producing a collection of real polynomials in two variables of degree 8 in one variable which are positive but are not a sum of three squares of rational…

Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…

Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

In this paper, we study rigidity of polynomials of arbitrary degree in the presence of neutral dynamics. Specifically, we focus on {non-renormalizable} (in the sense of Douady and Hubbard) complex polynomials of degree $d \geqslant 2$ that…