Minimal systems of binomial generators and the indispensable complex of a toric ideal

DOI10.1090/S0002-9939-07-09037-5zbMath1127.13018arXivmath/0607249MaRDI QIDQ5308108

Hara Charalambous, Anargyros Katsabekis, Apostolos Thoma

Publication date: 27 September 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0607249

zbMATH Keywords

minimal systems of generators; indispensable binomials; indispensable monomials

Mathematics Subject Classification ID

14M25: Toric varieties, Newton polyhedra, Okounkov bodies

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

05C99: Graph theory

Related Items

On pseudo symmetric monomial curves, LIFTINGS OF A MONOMIAL CURVE, Arithmetical rank of toric ideals associated to graphs, Gluing semigroups and strongly indispensable free resolutions, On complete intersection toric ideals of graphs, Markov complexity of monomial curves, Minimal generators of toric ideals of graphs, Simplicial complexes and minimal free resolution of monomial algebras, Generalized robust toric ideals, Markov bases and generalized Lawrence liftings, Binomial fibers and indispensable binomials, On the generalized Scarf complex of lattice ideals, Bouquet algebra of toric ideals, Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\), Minimal set of binomial generators for certain Veronese 3-fold projections, Minimal generating sets of lattice ideals, On decomposable semigroups and applications., COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS, On the binomial arithmetical rank of toric ideals, Indispensable binomials in semigroup ideals, Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators

Uses Software

• CoCoA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indispensable monomials of toric ideals and Markov bases
• Minimal systems of generators for ideals of semigroups
• Algebraic algorithms for sampling from conditional distributions
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Non-very ample configurations arising from contingency tables
• Matrices with Identical Sets of Neighbors
• Generic lattice ideals
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS