On the binomial arithmetical rank of toric ideals

DOI10.1142/S0219498814500303zbMath1304.14068arXiv1304.6607OpenAlexW2148162163MaRDI QIDQ2874694

Anargyros Katsabekis

Publication date: 8 August 2014

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

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

zbMATH Keywords

toric idealscircuitsarithmetical rankindispensable binomialsindispensable monomials

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Related Items (1)

CIO and ring graphs: deficiency and testing

Cites Work

• Toric ideals and their circuits
• Minimal generators of toric ideals of graphs
• Matchings in simplicial complexes, circuits and toric varieties
• Toric ideals generalized by quadratic binomials
• Bipartite graphs whose edge algebras are complete intersections
• Arithmetical rank of toric ideals associated to graphs
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS

This page was built for publication: On the binomial arithmetical rank of toric ideals