Graver degrees are not polynomially bounded by true circuit degrees
classification
🧮 math.AC
math.CO
keywords
degreesboundedgraverpolynomiallytruebasiscircuitcircuits
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.