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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1163420 (Why is no real title available?)
- scientific article; zbMATH DE number 2190625 (Why is no real title available?)
- Algebraic algorithms for sampling from conditional distributions
- An indispensable classification of monomial curves in \(\mathbb{A}^4(k)\)
- Binomial ideals
- Combinatorics of binomial primary decomposition
- Computing generating sets of lattice ideals and Markov bases of lattices
- Computing toric ideals
- GRIN: an implementation of Gröbner bases for integer programming
- Generic lattice ideals
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Indispensable binomials in semigroup ideals
- Indispensable monomials of toric ideals and Markov bases
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Some complexity results for polynomial ideals
- Theory and applications of lattice point methods for binomial ideals
- Toric Ideals of Phylogenetic Invariants
Cited in
(13)- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- The universal Gröbner basis of a binomial edge ideal
- Some results on special binomial ideals
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
- Gluing semigroups and strongly indispensable free resolutions
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Indispensable binomials in semigroup ideals
- Minimal set of binomial generators for certain Veronese 3-fold projections
- On the strongly robust property of toric ideals
- Arithmetical rank of binomial ideals
- Minimal generating sets of lattice ideals
- Indispensable monomials of toric ideals and Markov bases
- Computing the binomial part of a polynomial ideal
This page was built for publication: Binomial fibers and indispensable binomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898283)
