Separating inequalities for nonnegative polynomials that are not sums of squares

DOI10.1016/J.JSC.2014.09.010zbMATH Open1352.11042arXiv1201.4061OpenAlexW2037930073MaRDI QIDQ480684FDOQ480684

Authors: Sadik Iliman, Timo de Wolff 

Publication date: 9 December 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: Ternary sextics and quaternary quartics are the smallest cases where there exist nonnegative polynomials that are not sums of squares (SOS). A complete classification of the difference between these cones was given by G. Blekherman via analyzing the extreme rays of the corresponding dual cones. However, an exact computational approach in order to build separating extreme rays for nonnegative polynomials that are not sums of squares is a widely open problem. We provide a method substantially simplifying this computation for certain classes of polynomials on the boundary of the PSD cones. In particular, our method yields separating extreme rays for every nonnegative ternary sextic with at least seven zeros. As an application to further instances, we compute a rational certificate proving that the Motzkin polynomial is not SOS.

Full work available at URL: https://arxiv.org/abs/1201.4061

Recommendations

• Nonnegative polynomials and sums of squares
• Dimensional differences between faces of the cones of nonnegative polynomials and sums of squares
• Algebraic boundaries of Hilbert's SOS cones
• Extreme positive ternary sextics
• Dimensional differences between faces of the cones of nonnegative polynomials and sums of squares

zbMATH Keywords

certificatePSDextreme rayexact methodsnonnegative polynomialSOS

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) General ternary and quaternary quadratic forms; forms of more than two variables (11E20) Sums of squares and representations by other particular quadratic forms (11E25) Real algebraic and real-analytic geometry (14P99)

Cites Work

• Title not available (Why is that?)
• Global optimization with polynomials and the problem of moments
• Title not available (Why is that?)
• The Geometry of Syzygies
• Sums of squares, moment matrices and optimization over polynomials
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• Real zeros for positive semidefinite forms. I
• Discriminants and nonnegative polynomials
• Positive polynomials and sums of squares
• Cayley–Bacharach Formulas
• Nonnegative polynomials and sums of squares
• Cayley-Bacharach theorems and conjectures
• Algebraic boundaries of Hilbert's SOS cones
• There are significantly more nonnegative polynomials than sums of squares
• Quartic curves and their bitangents
• Selected papers. Ed. by David Cantor, Basil Gordon, Bruce Rothschild
• Convexity properties of the cone of nonnegative polynomials

Cited In (4)

• Test sets for nonnegativity of polynomials invariant under a finite reflection group
• The core variety of a multisequence in the truncated moment problem
• Multihomogeneous nonnegative polynomials and sums of squares
• Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares

This page was built for publication: Separating inequalities for nonnegative polynomials that are not sums of squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480684)