English

Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits

Algebraic Geometry 2015-10-27 v3 Combinatorics

Abstract

We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of sparse polynomials. In particular, nonnegativity is characterized by an invariant, which can be immediately derived from the initial polynomial. Furthermore, nonnegativity of such polynomials ff coincides with solidness of the amoeba of ff, i.e., the Log-absolute-value image of the algebraic variety V(f)(C)n\mathcal{V}(f) \subset (\mathbb{C}^*)^n of ff. These results generalize earlier works both in amoeba theory and real algebraic geometry by Fidalgo, Kovacec, Reznick, Theobald and de Wolff and solve an open problem by Reznick. They establish the first direct connection between amoeba theory and nonnegativity of real polynomials. Additionally, these statements yield a completely new class of nonnegativity certificates independent from sums of squares certificates.

Keywords

Cite

@article{arxiv.1402.0462,
  title  = {Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits},
  author = {Sadik Iliman and Timo de Wolff},
  journal= {arXiv preprint arXiv:1402.0462},
  year   = {2015}
}

Comments

Minor revision, final version, 38 pages, 6 figures