Computing the binomial part of a polynomial ideal (Q6192534): Difference between revisions

Let \(R = K[x_1, \ldots, x_n]\) be the polynomial ring in terms of the \(x_i\)'s over the field \(K\). A binomial in this ring is a polynomial that contains at most two terms. An ideal is called a binomial ideal if it is generated by a set of binomials. The aim of this paper is to present an effective approach for constructing \(Bin(I)\), which is the sub-ideal of \(I\) that contains all binomials in \(I\). This construction has various applications in areas such as computing algebraic relations of \(C\)-finite sequences, solving the constructive membership problem for commutative matrix groups, and computing the Zariski closure of a matrix group. In 2005, Kreuzer and Robbiano demonstrated that \(Bin(I)\) can be computed using the homogenization technique. When the property \(I:(x_1\cdots x_n) = I\) holds, Jensen et al. presented an algorithm for computing this sub-ideal. In the first step, the authors calculate \(Bin(I)\) under the assumption that \(I\) satisfies this property. This provides an alternative approach to the one given by Jensen et al. Then, they proceed to address the computation of \(Bin(I)\) for general ideals.