Cohen-Macaulay binomial edge ideals
Viviana Ene, Juergen Herzog, Takayuki Hibi
TL;DR
This paper investigates the algebraic properties of binomial edge ideals, focusing on their depth and Cohen-Macaulayness, and classifies specific graph classes where these ideals have desirable algebraic properties.
Contribution
It provides a classification of closed graphs with Cohen-Macaulay binomial edge ideals and analyzes their depth properties.
Findings
Classification of closed graphs with Cohen-Macaulay binomial edge ideals
Determination of depth for certain classes of binomial edge ideals
Identification of algebraic properties linked to graph structures
Abstract
We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.
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 · Rings, Modules, and Algebras · Cholinesterase and Neurodegenerative Diseases