Binomial fibers and indispensable binomials (Q898283)

Let \(k\) be a field and \(R=K[x_1,\dots,x_n]\) be a polynomial ring. The authors consider binomial ideals \(I\) in general that is ideals generated by monomials and binomials. Toric and lattice ideals are particular cases. A set \(F\) of monomials is a \(I\)-fiber if there exists a monomial \(u\) such that \(v\in F\) if and only if \(v-\lambda u\in I\) for some non zero \(\lambda \in k\). Then they define an equivalence relation between the \(I-\)fibers and also an order. One of the main results is that a certain set of equivalence classes of \(I-\)fibers is an invariant, associated to any generating set of I. A related question is about indispensable binomials. A binomial in \(I\) is called indispensable if it appears in any minimal generating set of \(I\). Results concerning indispensable binomials are generally found in the setting of toric ideals. The authors study the general case so we also have indispensable monomials. For any fiber \(F\) they define a graph, which allows to give necessary and sufficient conditions for a binomial to be indispensable. Finally, the authors provide an algorithm to compute the indispensable binomials of a binomial ideal from a given generating set of binomials.