A Polyhedral Method for Sparse Systems with Many Positive Solutions
From MaRDI portal
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Solving polynomial systems; resultants (13P15) Complete intersections (14M10) Topology of real algebraic varieties (14P25) Computational aspects of higher-dimensional varieties (14Q15) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Abstract: We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. The number of positive solutions obtained with our method is governed by the size of the largest positively decorable subcomplex of the triangulation. Here, positive decorability is a property that we introduce and which is dual to being a subcomplex of some regular triangulation. Using this duality, we produce large positively decorable subcomplexes of the boundary complexes of cyclic polytopes. As a byproduct we get new lower bounds, some of them being the best currently known, for the maximal number of positive solutions of polynomial systems with prescribed numbers of monomials and variables. We also study the asymptotics of these numbers and observe a log-concavity property.
Recommendations
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Positive solutions of sparse polynomial systems
- Solution of sparse positive definite systems on a hypercube
- A new computational method for the sparsest solutions to systems of linear equations
- scientific article; zbMATH DE number 3850364
- Affine solution sets of sparse polynomial systems
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems
- Sparse approximate solutions to max-plus equations
- Sparse polynomial approximations for affine parametric saddle point problems
Cites work
- Combinatorics and commutative algebra.
- Constructing polynomial systems with many positive solutions using tropical geometry
- Convex Polytopes
- Convex Polytopes
- Foldable triangulations of lattice polygons
- Hirsch polytopes with exponentially long combinatorial segments
- scientific article; zbMATH DE number 3908819 (Why is no real title available?)
- scientific article; zbMATH DE number 3977149 (Why is no real title available?)
- scientific article; zbMATH DE number 3678765 (Why is no real title available?)
- scientific article; zbMATH DE number 510288 (Why is no real title available?)
- scientific article; zbMATH DE number 701753 (Why is no real title available?)
- scientific article; zbMATH DE number 711287 (Why is no real title available?)
- scientific article; zbMATH DE number 5245178 (Why is no real title available?)
- Lower bounds for real solutions to sparse polynomial systems
- New fewnomial upper bounds from Gale dual polynomial systems
- Polynomial systems supported on circuits and dessins d'enfants
- Projectivities in simplicial complexes and colorings of simple polytopes
- Real solutions to equations from geometry
- The number of roots of a system of equations
- Triangulations. Structures for algorithms and applications
- Viro method for the construction of real complete intersections
- Why Delannoy numbers?
Cited in
(17)- Regions of multistationarity in cascades of Goldbeter-Koshland loops
- Affine solution sets of sparse polynomial systems
- Parameter regions that give rise to \(2\lfloor \frac{n}{2} \rfloor +1\) positive steady states in the \(n\)-site phosphorylation system
- 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
- Lower bounds for positive roots and regions of multistationarity in chemical reaction networks
- scientific article; zbMATH DE number 3885206 (Why is no real title available?)
- Algebra and geometry in the study of enzymatic cascades
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Maximally positive polynomial systems supported on circuits
- A geometric approach for analyzing parametric biological systems by exploiting block triangular structure
- Positive solutions of sparse polynomial systems
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- Computing positive tropical varieties and lower bounds on the number of positive roots
- Sparse systems with high local multiplicity
- Positive equilibria in mass action networks: geometry and bounds
- Families of polynomials in the study of biochemical reaction networks
This page was built for publication: A Polyhedral Method for Sparse Systems with Many Positive Solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4624926)
