Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems

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öbner systems. Considering rate constants as parameters, we compute comprehensive Gröbner 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.

References in corpus (7)

• Detecting Binomiality
• The multistationarity structure of networks with intermediates and a binomial core network
• Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks
• 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
• Analysis of the Conradi-Kahle Algorithm for Detecting Binomiality on Biological Models
• First-Order Tests for Toricity