Classification of unmixed parity binomial edge ideals of cactus and chordal graphs
Deblina Dey, A. V. Jayanthan, Sarang Sane
TL;DR
This paper characterizes when parity binomial edge ideals of cactus and chordal graphs are unmixed and Cohen-Macaulay, linking algebraic properties to graph structure.
Contribution
It provides a complete characterization of unmixed and Cohen-Macaulay parity binomial edge ideals for these graph classes based on their structural features.
Findings
Characterization of unmixed parity binomial edge ideals
Criteria for Cohen-Macaulay property in these ideals
Structural graph properties determining algebraic properties
Abstract
In this article, we characterize all unmixed and Cohen-Macaulay parity binomial edge ideals of cactus and chordal graphs in terms of the structural properties of the graph.
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 · Polynomial and algebraic computation · Advanced Combinatorial Mathematics