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

DOI10.1090/S0002-9939-07-09037-5zbMath1127.13018arXivmath/0607249OpenAlexW2042874561MaRDI 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 generatorsindispensable binomialsindispensable monomials

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Graph theory (05C99)

Related Items

Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators ⋮ Simplicial complexes and minimal free resolution of monomial algebras ⋮ Bouquet algebra of toric ideals ⋮ On complete intersection toric ideals of graphs ⋮ On pseudo symmetric monomial curves ⋮ Minimal generating sets of lattice ideals ⋮ Generalized robust toric ideals ⋮ Markov bases and generalized Lawrence liftings ⋮ Markov complexity of monomial curves ⋮ A semigroup defining the Gröbner degeneration of a toric ideal ⋮ Affine semigroups of maximal projective dimension ⋮ Binomial fibers and indispensable binomials ⋮ Asymptotic behavior of Markov complexity ⋮ Generic Toric Ideals and Row-Factorization Matrices in Numerical Semigroups ⋮ On decomposable semigroups and applications. ⋮ Minimal generators of toric ideals of graphs ⋮ On the generalized Scarf complex of lattice ideals ⋮ Gluing semigroups and strongly indispensable free resolutions ⋮ Arithmetical rank of toric ideals associated to graphs ⋮ LIFTINGS OF A MONOMIAL CURVE ⋮ Indispensable binomials in semigroup 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 ⋮ COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS ⋮ On the binomial arithmetical rank of toric ideals

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