English

Nonnegativity of signomials with Newton simplex over $\mathcal{A}$-convex sets

Combinatorics 2026-02-11 v2 Algebraic Geometry Optimization and Control

Abstract

We study a class of signomials whose positive support is the set of vertices of a simplex and which may have several negative support points in the simplex. Various groups of authors have provided an exact characterization for the global nonnegativity of a signomial in this class in terms of circuit signomials and that characterization provides a tractable nonnegativity test. We generalize this characterization to the constrained nonnegativity over a set XX under an additional convexity precondition in the exponential moment space. This provides a tractable nonnegativity test over XX for the class in terms of a power cone program. Our proof methods rely on a variant of the convex cone of constrained SAGE signomials (sums of arithmetic-geometric exponentials) and the duality theory.

Keywords

Cite

@article{arxiv.2504.10302,
  title  = {Nonnegativity of signomials with Newton simplex over $\mathcal{A}$-convex sets},
  author = {Gennadiy Averkov and Jonas Ellwanger and Thorsten Theobald and Timo de Wolff},
  journal= {arXiv preprint arXiv:2504.10302},
  year   = {2026}
}

Comments

16 pages, corrected version with substantial modifications, Theorem 1.2 in the former version was not correct and has changed, new coauthor