Binomial fibers and indispensable binomials
From MaRDI portal
Publication:898283
DOI10.1016/J.JSC.2015.09.005zbMATH Open1355.13019arXiv1501.05142OpenAlexW1769928814MaRDI QIDQ898283FDOQ898283
Authors: Hara Charalambous, Apostolos Thoma, Marius Vladoiu 
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1501.05142
Recommendations
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Title not available (Why is that?)
- Binomial ideals
- Computing generating sets of lattice ideals and Markov bases of lattices
- Algebraic algorithms for sampling from conditional distributions
- Toric Ideals of Phylogenetic Invariants
- Computing toric ideals
- GRIN: an implementation of Gröbner bases for integer programming
- Title not available (Why is that?)
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Generic lattice ideals
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- An indispensable classification of monomial curves in \(\mathbb{A}^4(k)\)
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- Some complexity results for polynomial ideals
- Indispensable binomials in semigroup ideals
- Combinatorics of binomial primary decomposition
- Theory and applications of lattice point methods for binomial ideals
- Indispensable monomials of toric ideals and Markov bases
Cited In (12)
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
- The universal Gröbner basis of a binomial edge ideal
- Arithmetical rank of binomial ideals
- Indispensable binomials in semigroup ideals
- Indispensable monomials of toric ideals and Markov bases
- Minimal set of binomial generators for certain Veronese 3-fold projections
- Some results on special binomial ideals
- On the strongly robust property of toric ideals
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Gluing semigroups and strongly indispensable free resolutions
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Minimal generating sets of lattice ideals
Uses Software
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)
