TY  - JOUR
A1  - Naumann, Helen
A1  - Theobald, Thorsten
T1  - Sublinear circuits for polyhedral sets
T2  - Vietnam journal of mathematics
N2  - Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the arithmetic-geometric inequality. Here, we study the polyhedral combinatorics of sublinear circuits for polyhedral constraint sets. We give results on the relation between the sublinear circuits and their supports and provide necessary as well as sufficient criteria for sublinear circuits. Based on these characterizations, we provide some explicit results and enumerations for two prominent polyhedral cases, namely the non-negative orthant and the cube [− 1,1]n.
KW  - Positive function
KW  - Sublinear circuit
KW  - Sums of arithmetic-geometric exponentials
KW  - Non-negativity certificate
KW  - Polyhedron
Y1  - 2021
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/64053
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30:3-640534
SN  - 2305-2228
N1  - Open Access funding enabled and organized by Projekt DEAL.
VL  - 2021
PB  - Springer
CY  - Singapore
ER  -