Related papers: Nonnegative Polynomials and Sums of Squares
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).…
This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…
We prove that hypersurfaces defined by irreducible square-free polynomials have rational singularities. As an easy consequence, we deduce that certain (possibly non-square-free) polynomials associated to pairs of square-free polynomials…
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…
Hankel spectrahedra are the dual convex cones to the cone of sums of squares of real polynomials, and we study them from the point of view of convex algebraic geometry. We show that the Zariski closure of the union of all extreme rays of…
Optimizing over the cone of nonnegative polynomials, and its dual counterpart, optimizing over the space of moments that admit a representing measure, are fundamental problems that appear in many different applications from engineering and…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
We provide a complete and explicit characterization of the exposed extreme rays of the cone of sums of nonnegative circuit (SONC) polynomials. The criterion we derive is purely combinatorial and depends only on the existence of certain…
We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…
We show that existence of a global polynomial Lyapunov function for a homogeneous polynomial vector field or a planar polynomial vector field (under a mild condition) implies existence of a polynomial Lyapunov function that is a sum of…
A blender is a closed convex cone of real homogeneous polynomials that is also closed under linear changes of variable. Non-trivial blenders only occur in even degree. Examples include the cones of psd forms, sos forms, convex forms and…
In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer $n$, we find the minimum number of squares of integers except for $n$ whose sums represent all positive integers that are represented…
In a paper published by this author in www.academia.edu(see reference[3]), it was established that there exist no three positive integers which are consecutive terms of an arithmetic progression; and whose sum of squares is a perfect or…
The classes of sums of arithmetic-geometric exponentials (SAGE) and of sums of nonnegative circuit polynomials (SONC) provide nonnegativity certificates which are based on the inequality of the arithmetic and geometric means. We study the…
In this article, we prove that a complex cone is a set of injectivity for the twisted spherical means for the class of all continuous functions on $\mathbb C^n$ as long as it does not completely lay on the level surface of any bi-graded…
We introduce and study a cone which consists of a class of generalized polynomial functions and which provides a common framework for recent non-negativity certificates of polynomials in sparse settings. Specifically, this…
A well-known result of Murray Marshall states that every $f \in \mathbb{R} [X,Y]$ non-negative on the strip $[0,1] \times \mathbb{R}$ can be written as $f= \sigma_0 + \sigma_1 X(1-X)$ with $\sigma_0, \sigma_1$ sums of squares in $\mathbb{R}…
Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…
The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…
We link the study of positive quantum maps, block positive operators, and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic…