Related papers: Nonnegative Polynomials and Sums of Squares

Convex or concave sequences of $n$ positive terms, viewed as vectors in $n$-space, constitute convex cones with $2n-2$ and $n$ extreme rays, respectively. Explicit description is given of vectors spanning these extreme rays, as well as of…

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such…

We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…

An additive submonoid of the nonnegative cone of the real line is called a positive monoid. Positive monoids consisting of rational numbers (also known as Puiseux monoids) have been the subject of several recent papers. Moreover, those…

We prove a result about the non-existence of certain sums-of-squares formulas over a field. This generalizes an old theorem which used topological K-theory to obtain obstruction conditions when the field is the real numbers. Our result…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Given a pseudoconvex hypersurface in C^n and an arbitrary weight, we show the existence of local coordinates in which the polynomial model contains a particularly simple sum of squares of monomials. Our second main result provides a…

Optimization over non-negative polynomials is fundamental for nonlinear systems analysis and control. We investigate the relation between three tractable relaxations for optimizing over sparse non-negative polynomials: sparse sum-of-squares…

A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent conditions are derived and used to prove that…

We prove that for every positive integer $d$ and forest $F$, the class of intersection graphs of axis-aligned boxes in $\mathbb{R}^d$ with no induced $F$ subgraph is (polynomially) $\chi$-bounded.

Let $f_1,\dots,f_m$ be polynomials in $n$ variables with coefficients in a finite field $\mathbb{F}_q$. We estimate the number of points $\underline{x}$ in $\mathbb{F}_q^n$ such that each value $f_i(\underline{x})$ is a nonzero square in…

The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…

We study the boundary of the nonnegative trigonometric polynomials from the algebraic point of view. In particularly, we show that it is a subset of an irreducible algebraic hypersurface and established its explicit form in terms of…

We prove that the hyperbolicity cones of elementary symmetric polynomials are spectrahedral, i.e., they are slices of the cone of positive semidefinite matrices. The proof uses the matrix--tree theorem, an idea already present in Choe et…

We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial $f$ of degree $d$, there are exactly $2^{d-1}$ distinct degree $d$ polynomials with the same set of cyclic resultants as $f$.…

We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…