Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounded powers of edge ideals: Gorenstein polytopes

Published 13 Oct 2025 in math.AC and math.CO | (2510.11668v1)

Abstract: Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G) \subset S$ the edge ideal of a finite graph $G$ on $n$ vertices. Given a vector $\mathfrak{c}\in\mathbb{N}n$ and an integer $q\geq 1$, we denote by $(I(G)q)_{\mathfrak{c}}$ the ideal of $S$ generated by those monomials belonging to $I(G)q$ whose exponent vectors are componentwise bounded above by $\mathfrak{c}$. Let $\delta_{\mathfrak{c}}(I(G))$ denote the largest integer $q$ for which $(I(G)q)_{\mathfrak{c}}\neq (0)$. Since $(I(G){\delta_{\mathfrak{c}}(I)})_{\mathfrak{c}}$ is a polymatroidal ideal, it follows that its minimal set of monomial generators is the set of bases of a discrete polymatroid $\mathcal{D}(G,\mathfrak{c})$. In the present paper, a classification of Gorenstein polytopes of the form ${\rm conv}(\mathcal{D}(G,\mathfrak{c}))$ is studied.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.