Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
From MaRDI portal
Publication:831995
DOI10.1007/978-3-030-85165-1_19zbMATH Open1499.13076arXiv2107.01706OpenAlexW3197172713MaRDI QIDQ831995FDOQ831995
Publication date: 24 March 2022
Abstract: We consider the problem of binomiality of the steady state ideals of biochemical reaction networks. We are interested in finding polynomial conditions on the parameters such that the steady state ideal of a chemical reaction network is binomial under every specialisation of the parameters if the conditions on the parameters hold. We approach the binomiality problem using Comprehensive Gr"obner systems. Considering rate constants as parameters, we compute comprehensive Gr"obner systems for various reactions. In particular, we make automatic computations on n-site phosphorylations and biomodels from the Biomodels repository using the grobcov library of the computer algebra system Singular.
Full work available at URL: https://arxiv.org/abs/2107.01706
chemical reaction networkssymbolic computationtoric varietiesbinomial idealsmass action kineticsscientific computationGröbner basescomprehensive Gröbner bases
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Structure of MESSI Biological Systems
- Introduction to Toric Varieties. (AM-131)
- Chemical reaction systems with toric steady states
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Binomial ideals
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Toric dynamical systems
- An alternative approach to comprehensive Gröbner bases
- An efficient method for computing comprehensive Gröbner bases
- The complexity of the word problems for commutative semigroups and polynomial ideals
- On the number of steady states in a multiple futile cycle
- The complexity of linear problems in fields
- Real quantifier elimination is doubly exponential
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Complexity of deciding Tarski algebra
- Multistationarity in structured reaction networks
- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics
- Canonical comprehensive Gröbner bases
- Parametric FGLM algorithm
- Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208]
- Foundations of chemical reaction network theory
- Detecting binomiality
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
- The Gröbner cover
- The multistationarity structure of networks with intermediates and a binomial core network
- Efficiently and effectively recognizing toricity of steady state varieties
- A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks
- First-order tests for toricity
- Gröbner systems conversion
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
- Comprehensive Gröbner bases and regular rings
- Three Waves of Chemical Dynamics
- Generalized Mass Action Law and Thermodynamics of Nonlinear Markov Processes
Cited In (2)
Uses Software
Recommendations
- Verifying chemical reaction network implementations: a bisimulation approach 👍 👎
- Deterministic function computation with chemical reaction networks 👍 👎
- Verifying Chemical Reaction Network Implementations: A Bisimulation Approach 👍 👎
- Deterministic Function Computation with Chemical Reaction Networks 👍 👎
- Composable computation in discrete chemical reaction networks 👍 👎
- On the complexity of reconstructing chemical reaction networks 👍 👎
- Fast enumeration of non-isomorphic chemical reaction networks 👍 👎
- Verifying chemical reaction network implementations: a pathway decomposition approach 👍 👎
- Composable Computation in Discrete Chemical Reaction Networks 👍 👎
- A compositional framework for reaction networks 👍 👎
This page was built for publication: Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831995)
