Level and pseudo-Gorenstein binomial edge ideals
Giancarlo Rinaldo, Rajib Sarkar
TL;DR
This paper characterizes level and pseudo-Gorenstein binomial edge ideals with specific regularities, showing they are cones and providing complete descriptions, especially for bipartite graphs.
Contribution
It provides a complete characterization of level and pseudo-Gorenstein binomial edge ideals with certain regularities, including their structure as cones and their behavior in bipartite graphs.
Findings
Level binomial edge ideals with regularity 2 are cones.
Pseudo-Gorenstein binomial edge ideals with regularity 3 are cones.
Complete descriptions of these ideals in bipartite graphs.
Abstract
We prove that level binomial edge ideals with regularity 2 and pseudo-Gorenstein binomial edge ideals with regularity 3 are cones, and we describe them completely. Also, we characterize level and pseudo-Gorenstein binomial edge ideals of bipartite graphs.
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