A Polyhedral Method for Sparse Systems with Many Positive Solutions

DOI10.1137/18M1181912zbMath1473.14111arXiv1804.05683OpenAlexW3100543751WikidataQ128719421 ScholiaQ128719421MaRDI QIDQ4624926

Pierre-Jean Spaenlehauer, Francisco Santos, Frédéric Bihan

Publication date: 20 February 2019

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

triangulationspolynomial systemscyclic polytopes

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects of higher-dimensional varieties (14Q15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Complete intersections (14M10) Topology of real algebraic varieties (14P25) Solving polynomial systems; resultants (13P15)

Related Items

Families of polynomials in the study of biochemical reaction networks ⋮ A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure ⋮ Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks ⋮ On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) ⋮ Sign conditions for the existence of at least one positive solution of a sparse polynomial system ⋮ Algebra and Geometry in the Study of Enzymatic Cascades ⋮ Regions of multistationarity in cascades of Goldbeter-Koshland loops ⋮ Parameter regions that give rise to \(2\lfloor \frac{n}{2} \rfloor +1\) positive steady states in the \(n\)-site phosphorylation system ⋮ Lower bounds for positive roots and regions of multistationarity in chemical reaction networks

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projectivities in simplicial complexes and colorings of simple polytopes
• Triangulations. Structures for algorithms and applications
• The number of roots of a system of equations
• Constructing polynomial systems with many positive solutions using tropical geometry
• Hirsch polytopes with exponentially long combinatorial segments
• Viro method for the construction of real complete intersections
• Combinatorics and commutative algebra.
• Lower bounds for real solutions to sparse polynomial systems
• Why Delannoy numbers?
• Convex Polytopes
• Foldable Triangulations of Lattice Polygons
• Polynomial systems supported on circuits and dessins d'enfants
• Convex Polytopes