相关论文: Isoparametric polynomials and sums of squares

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…

We investigate the quantitative relationship between nonnegative polynomials and sums of squares of polynomials. We show that if the degree is fixed and the number of variables grows then there are significantly more nonnegative polynomials…

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…

Necessary and sufficient conditions are obtained under which the numerator of the partial derivative of a rational function holomorphic in open upper poly-halfplane is the sum of squares of polynomials.

Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

The relationship between nonnegative polynomials and sums of squares is a classical topic in real algebraic geometry. We study \emph{stubborn polynomials} $f$ on a real variety $X$, which are polynomials nonnegative on $X$, such that no odd…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

We study dimensions of the faces of the cone of nonnegative polynomials and the cone of sums of squares; we show that there are dimensional differences between corresponding faces of these cones. These dimensional gaps occur in all cases…

We pose and discuss several Hermitian analogues of Hilbert's $17$-th problem. We survey what is known, offer many explicit examples and some proofs, and give applications to CR geometry. We prove one new algebraic theorem: a non-negative…

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…

We interpret a counterexample to Hilbert's 14th problem by S. Kuroda geometrically in two ways: As ring of regular functions on a smooth rational quasiprojective variety over any field K of characteristic 0, and, in the special case where K…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

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…

Quillen proved that repeated multiplication of the standard sesquilinear form to a positive Hermitian bihomogeneous polynomial eventually results in a sum of Hermitian squares, which was the first Hermitian analogue of Hilbert's seventeenth…

Hilbert showed that for most $(n,m)$ there exist psd forms $p(x_1,...,x_n)$ of degree $m$ which cannot be written as a sum of squares of forms. His 17th problem asked whether, in this case, there exists a form $h$ so that $h^2p$ is a sum of…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

It is well-known that every non-negative univariate real polynomial can be written as the sum of two polynomial squares with real coefficients. When one allows a weighted sum of finitely many squares instead of a sum of two squares, then…

We study real bihomogeneous polynomials $r(z,\bar{z})$ in $n$ complex variables for which $r(z,\bar{z}) \|z\|^2$ is the squared norm of a holomorphic polynomial mapping. Such polynomials are the focus of the Sum of Squares Conjecture, which…