Bounded powers of edge ideals: Gorenstein polytopes
Abstract
Let S=K[x1, …,xn] denote the polynomial ring in n variables over a field K and I(G) ⊂ S the edge ideal of a finite graph G on n vertices. Given a vector c∈Nn and an integer q≥ 1, we denote by (I(G)q)c the ideal of S generated by those monomials belonging to I(G)q whose exponent vectors are componentwise bounded above by c. Let δc(I(G)) denote the largest integer q for which (I(G)q)c≠ (0). Since (I(G)δc(I))c is a polymatroidal ideal, it follows that its minimal set of monomial generators is the set of bases of a discrete polymatroid D(G,c). In the present paper, a classification of Gorenstein polytopes of the form conv(D(G,c)) is studied.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.