Graver degrees are not polynomially bounded by true circuit degrees

DOI10.1016/j.jpaa.2014.09.021zbMath1333.14049arXiv1306.3305OpenAlexW1964449757MaRDI QIDQ2259178

Apostolos Thoma, Christos Tatakis

Publication date: 27 February 2015

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basistoric idealGraver basis

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Related Items (2)

On the relative size of toric bases ⋮ On toric ideals arising from signed graphs

Cites Work

• On the universal Gröbner bases of toric ideals of graphs
• Minimal generators of toric ideals of graphs
• On the universal Gröbner bases of varieties of minimal degree
• Toric ideals generalized by quadratic binomials
• Equations Defining Toric Varieties
• Rees algebras of edge ideals

This page was built for publication: Graver degrees are not polynomially bounded by true circuit degrees