Binomial fibers and indispensable binomials
Commutative Algebra
2015-10-09 v2
Abstract
Let be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of . We provide a simple and efficient algorithm to compute the indispensable binomials of a binomial ideal from a given generating set of binomials and an algorithm to detect whether a binomial ideal is generated by indispensable binomials.
Cite
@article{arxiv.1501.05142,
title = {Binomial fibers and indispensable binomials},
author = {Hara Charalambous and Apostolos Thoma and Marius Vladoiu},
journal= {arXiv preprint arXiv:1501.05142},
year = {2015}
}
Comments
15 pages, 2 figures. All results have been extended to the general case of binomial ideals. Several proofs were added/modified and there is a new theorem, Theorem 1.8. The paper will appear in Journal of Symbolic Computation