Detection of binomiality of polynomial systems is discussed. The focus is on linear-algebraic methods which are applicable to a class of large examples where Gr\"obner basis methods fail. The results are illustrated on steady state equations in chemical reaction network theory .
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and source of examples is the simplification of steady state equations of chemical reaction networks. For homogeneous ideals we give an efficient, Gr\"obner-free algorithm for binomiality detection, based on linear algebra only. On inhomogeneous input the algorithm can only give a sufficient condition for binomiality. As a remedy we construct a heuristic toolbox that can lead to simplifications even if the given ideal is not binomial .
R
Detection of binomiality of polynomial systems is discussed. The focus is on linear-algebraic methods which are applicable to a class of large examples where Gr\"obner basis methods fail. The results are illustrated on
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and source of examples is the simplification of
R
in chemical reaction network theory
of chemical reaction networks. For homogeneous ideals we give an efficient, Gr\"obner-free algorithm for binomiality detection, based on linear algebra only. On inhomogeneous input the algorithm can only give a sufficient condition for binomiality. As a remedy we construct a heuristic toolbox that can lead to simplifications even if the given ideal is not binomial