Efficiently and effectively recognizing toricity of steady state varieties
From MaRDI portal
Publication:2035620
DOI10.1007/s11786-020-00479-9zbMath1495.14095arXiv1910.04100OpenAlexW3044109180MaRDI QIDQ2035620
Andreas Weber, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Dima Yu. Grigoriev
Publication date: 25 June 2021
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.04100
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Real algebraic sets (14P05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Systems biology, networks (92C42)
Related Items
Parametric toricity of steady state varieties of reaction networks, Testing binomiality of chemical reaction networks using comprehensive Gröbner systems, From Polynomial Invariants to Linear Loops, Algorithmic reduction of biological networks with multiple time scales, Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chemical reaction systems with toric steady states
- On efficient sparse integer matrix Smith normal form computations
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Toric dynamical systems
- Detecting binomiality
- Better answers to real questions
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations
- The complexity of linear problems in fields
- Solving systems of polynomial inequalities in subexponential time
- Real quantifier elimination is doubly exponential
- Partial cylindrical algebraic decomposition for quantifier elimination
- Complexity of deciding Tarski algebra
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Simplification of quantifier-free formulae over ordered fields
- Foundations of chemical reaction network theory
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Binomial ideals
- Multistationarity in the space of total concentrations for systems that admit a monomial parametrization
- Identifying the parametric occurrence of multiple steady states for some biological networks
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics
- Introduction to Toric Varieties. (AM-131)
- The Structure of MESSI Biological Systems
- Solving SAT and SAT Modulo Theories
- New Domains for Applied Quantifier Elimination
- Efficient projection orders for CAD
- Decompositions of binomial ideals
- Algorithms in real algebraic geometry
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
