Detecting Binomiality
Abstract
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.
Cite
@article{arxiv.1502.04893,
title = {Detecting Binomiality},
author = {Carsten Conradi and Thomas Kahle},
journal= {arXiv preprint arXiv:1502.04893},
year = {2015}
}
Comments
14 pages, v2: Theorem 2.8 replaced by Example 2.8, v3: final version as in Adv.Appl.Math