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

07/04/2021
by   Hamid Rahkooy, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

Multistationarity for Fewnomial Chemical Reaction Networks

We study chemical reaction networks with few chemical complexes. Under m...
research
07/09/2018

Multistationarity and Bistability for Fewnomial Chemical Reaction Networks

Bistability and multistationarity are properties of reaction networks li...
research
02/28/2020

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks

Motivated by problems from Chemical Reaction Network Theory, we investig...
research
02/10/2020

First-Order Tests for Toricity

Motivated by problems arising with the symbolic analysis of steady state...
research
10/02/2020

Kac-Rice formulas and the number of solutions of parametrized systems of polynomial equations

Kac-Rice formulas express the expected number of elements a fiber of a r...
research
03/21/2018

Groebner bases of reaction networks with intermediate species

In this work we consider the computation of Groebner bases of the steady...
research
12/29/2022

A fast and convergent combined Newton and gradient descent method for computing steady states of chemical reaction networks

In this work we present a fast, globally convergent, iterative algorithm...

Please sign up or login with your details

Forgot password? Click here to reset