English

Bounded powers of edge ideals: Gorenstein polytopes

Commutative Algebra 2025-10-14 v1 Combinatorics

Abstract

Let S=K[x1,,xn]S=K[x_1, \ldots,x_n] denote the polynomial ring in nn variables over a field KK and I(G)SI(G) \subset S the edge ideal of a finite graph GG on nn vertices. Given a vector cNn\mathfrak{c}\in\mathbb{N}^n and an integer q1q\geq 1, we denote by (I(G)q)c(I(G)^q)_{\mathfrak{c}} the ideal of SS generated by those monomials belonging to I(G)qI(G)^q whose exponent vectors are componentwise bounded above by c\mathfrak{c}. Let δc(I(G))\delta_{\mathfrak{c}}(I(G)) denote the largest integer qq for which (I(G)q)c(0)(I(G)^q)_{\mathfrak{c}}\neq (0). Since (I(G)δc(I))c(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 D(G,c)\mathcal{D}(G,\mathfrak{c}). In the present paper, a classification of Gorenstein polytopes of the form conv(D(G,c)){\rm conv}(\mathcal{D}(G,\mathfrak{c})) is studied.

Keywords

Cite

@article{arxiv.2510.11668,
  title  = {Bounded powers of edge ideals: Gorenstein polytopes},
  author = {Takayuki Hibi and Seyed Amin Seyed Fakhari},
  journal= {arXiv preprint arXiv:2510.11668},
  year   = {2025}
}