Sublinear Circuits for Polyhedral Sets
| Autor: | Thorsten Theobald, Helen Naumann |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
medicine.medical_specialty
msc:90C30 Sublinear function General Mathematics Polyhedral combinatorics Matroid Computer Science::Hardware Architecture Computer Science::Emerging Technologies TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY FOS: Mathematics medicine Mathematics - Combinatorics ddc:510 Computer Science::Data Structures and Algorithms Mathematics Discrete mathematics msc:14P05 Exponential function Orthant msc:52B40 msc:05B35 Core (graph theory) Combinatorics (math.CO) 05B35 14P05 52A20 52B40 90C30 Affine transformation Cube msc:52A20 MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Vietnam Journal of Mathematics. 50:447-468 |
| ISSN: | 2305-2228 2305-221X |
| DOI: | 10.1007/s10013-021-00528-1 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink