Depth of initial ideals of normal edge rings
Abstract
Let G be a finite graph on the vertex set [d] = \1, ..., d \ with the edges e1, ..., en and K[] = K[t1, ..., td] the polynomial ring in d variables over a field K. The edge ring of G is the semigroup ring K[G] which is generated by those monomials e = titj such that e = \i, j\ is an edge of G. Let K[] = K[x1, ..., xn] be the polynomial ring in n variables over K and define the surjective homomorphism π : K[] K[G] by setting π(xi) = ei for i = 1, ..., n. The toric ideal IG of G is the kernel of π. It will be proved that, given integers f and d with 6 ≤ f ≤ d, there exist a finite connected nonbipartite graph G on [d] together with a reverse lexicographic order < on K[] and a lexicographic order < on K[] such that (i) K[G] is normal, (ii) K[]/∈i<(IG) = f and (iii) K[]/∈i<(IG) is Cohen--Macaulay, where ∈i<(IG) (resp.\ ∈i<(IG)) is the initial ideal of IG with respect to < (resp.\ <) and where K[]/∈i<(IG) is the depth of K[]/∈i<(IG).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.