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

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 con...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-07
Main Authors: Rahkooy, Hamid, Sturm, Thomas
Format: Article
Language:English
Subjects:
Chemical reactions
Computer algebra
Mathematical analysis
Parameters
Polynomials
Rate constants
Steady state
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422