Parametric toricity of steady state varieties of reaction networks
From MaRDI portal
Publication:831994
DOI10.1007/978-3-030-85165-1_18OpenAlexW3197753910MaRDI QIDQ831994FDOQ831994
Authors: Hamid Rahkooy, Thomas Sturm
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2105.10853
Recommendations
- Chemical reaction systems with toric steady states
- scientific article; zbMATH DE number 7774177
- Families of toric chemical reaction networks
- The existence and uniqueness of steady states for a class of chemical reaction networks
- The Disguised Toric Locus and Affine Equivalence of Reaction Networks
- Polynomial dynamical systems, reaction networks, and toric differential inclusions
- Efficiently and effectively recognizing toricity of steady state varieties
- On classes of reaction networks and their associated polynomial dynamical systems
- Analysis of reaction network systems using tropical geometry
- Graphically balanced equilibria and stationary measures of reaction networks
parameter uncertaintychemical reaction networkssymbolic computationtoric varietiesreal computationmass action kineticslogic computationscientific computation
Cites Work
- QEPCAD B
- The structure of MESSI biological systems
- Chemical reaction systems with toric steady states
- Partial cylindrical algebraic decomposition for quantifier elimination
- Binomial ideals
- Toric dynamical systems
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- On the combinatorial and algebraic complexity of quantifier elimination
- On the number of steady states in a multiple futile cycle
- Simplification of quantifier-free formulae over ordered fields
- Title not available (Why is that?)
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Cylindrical algebraic decomposition using validated numerics
- Applying Linear Quantifier Elimination
- Title not available (Why is that?)
- Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
- Complexity of deciding Tarski algebra
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of chemical reaction network theory
- Detecting binomiality
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Efficiently and effectively recognizing toricity of steady state varieties
- Algorithmic reduction of biological networks with multiple time scales
- A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks
- First-order tests for toricity
- Identifying the parametric occurrence of multiple steady states for some biological networks
- A kinetic mechanism for nicotinic acetylcholine receptors based on multiple allosteric transitions
- A case study on the parametric occurrence of multiple steady states
- Thirty years of virtual substitution. Foundations, techniques, applications
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Better answers to real questions
Cited In (2)
Uses Software
This page was built for publication: Parametric toricity of steady state varieties of reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831994)