Levelness versus almost Gorensteinness of edge rings of complete multipartite graphs
Akihiro Higashitani, Koji Matsushita

TL;DR
This paper characterizes when the edge rings of complete multipartite graphs are level or almost Gorenstein, providing complete criteria based on the graph parameters.
Contribution
It offers a full characterization of levelness and almost Gorensteinness for edge rings of complete multipartite graphs, a significant extension in the study of these properties.
Findings
Complete characterization of level edge rings
Complete characterization of almost Gorenstein edge rings
Criteria expressed in terms of graph parameters
Abstract
Levelness and almost Gorensteinness are well-studied properties on graded rings as a generalized notion of Gorensteinness. In the present paper, we study those properties for the edge rings of the complete multipartite graphs, denoted by with . We give the complete characterization of which is level in terms of and . Similarly, we also give the complete characterization of which is almost Gorenstein in terms of and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Algebraic structures and combinatorial models · Rings, Modules, and Algebras
