Computing the binomial part of a polynomial ideal
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.
- A space efficient algorithm for group structure computation
- Algorithms for commutative algebras over the rational numbers
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
- Binomial ideals
- Binomial ideals
- Binomiality testing and computing sparse polynomials via witness sets
- Cellular binomial ideals. Primary decomposition of binomial ideals
- Computational linear and commutative algebra
- Computing generating sets of lattice ideals and Markov bases of lattices
- Computing sparse multiples of polynomials
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Computing the structure of a finite abelian group
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Effective computation of the integral closure of a morphism
- Factoring into coprimes in essentially linear time
- Finding binomials in polynomial ideals
- scientific article; zbMATH DE number 4071018 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- Modern computer algebra
- Normalization of rings
- On some computational problems in finite abelian groups
- Order bounds for C2-finite sequences
- Quantum automata and algebraic groups
- Recognizing Units in Number Fields
- SINGULAR
- The calculation of radical ideals in positive characteristic
- When is a polynomial ideal binomial after an ambient automorphism?
This page was built for publication: Computing the binomial part of a polynomial ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192534)
