Parametric toricity of steady state varieties of reaction networks
From MaRDI portal
Publication:831994
DOI10.1007/978-3-030-85165-1_18OpenAlexW3197753910MaRDI QIDQ831994
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2105.10853
toric varietiessymbolic computationmass action kineticsparameter uncertaintychemical reaction networksreal computationlogic computationscientific computation
Uses Software
Cites Work
- Chemical reaction systems with toric steady states
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Toric dynamical systems
- Detecting binomiality
- Better answers to real questions
- On the number of steady states in a multiple futile cycle
- Partial cylindrical algebraic decomposition for quantifier elimination
- Complexity of deciding Tarski algebra
- Simplification of quantifier-free formulae over ordered fields
- Foundations of chemical reaction network theory
- 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
- 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
- Binomial ideals
- 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
- Cylindrical algebraic decomposition using validated numerics
- A kinetic mechanism for nicotinic acetylcholine receptors based on multiple allosteric transitions
- Applying Linear Quantifier Elimination
- The Structure of MESSI Biological Systems
- On the combinatorial and algebraic complexity of quantifier elimination
- QEPCAD B
- A Case Study on the Parametric Occurrence of Multiple Steady States
- Thirty Years of Virtual Substitution
- Decompositions of binomial ideals
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
