加载中…
Let denote the polynomial ring in variables over a field and the edge ideal of a finite graph on vertices. Given a vector and an integer , we denote by the ideal of generated by those monomials belonging to whose exponent vectors are componentwise bounded above by . Let denote the largest integer for which . Since is a polymatroidal ideal, it follows that its minimal set of monomial generators is the set of bases of a discrete polymatroid . In the present paper, a classification of Gorenstein polytopes of the form is studied.

生成讲解博客的中文版本

生成AI智能校验的中文版本