Graver degrees are not polynomially bounded by true circuit degrees

Abstract

Let $I_A$ be a toric ideal. We prove that the degrees of the elements of the Graver basis of $I_A$ are not polynomially bounded by the true degrees of the circuits of $I_A$.

8 pages, 1 figure

References in corpus (1)

• On the universal Gröbner bases of toric ideals of graphs

Cited by in corpus (2)

• On the relative size of toric bases
• A bound on degrees of primitive elements of toric graph ideals