Initial steps in the classification of maximal mediated sets

DOI10.1016/j.jsc.2020.07.013zbMath1475.52023arXiv1910.00502OpenAlexW3040772724MaRDI QIDQ820977

Oğuzhan Yürük, Olivia Röhrig, Timo de Wolff, Jacob Hartzer

Publication date: 29 September 2021

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

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

zbMATH Keywords

latticesums of squaresnonnegativitymaximal mediated setsum of nonnegative circuit polynomials

Mathematics Subject Classification ID

Convex programming (90C25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Sums of squares and representations by other particular quadratic forms (11E25) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10) Forms over real fields (11E10)

Related Items

SONC optimization and exact nonnegativity certificates via second-order cone programming

Uses Software

• GNU parallel

Cites Work

• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Forms derived from the arithmetic-geometric inequality
• Extremal positive semidefinite forms
• Lattice polytopes with distinct pair-sums
• Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
• Relative Entropy Relaxations for Signomial Optimization
• Semidefinite Optimization and Convex Algebraic Geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item