Normality criteria for monomial ideals
Luis A. Dupont, Humberto Mu\~noz-George, Rafael H. Villarreal
TL;DR
This paper develops criteria to determine when monomial ideals are normal, utilizing linear programming and graph theory, with specific results for degree-two monomials and edge ideals of graphs and clutters.
Contribution
It introduces new normality criteria for monomial ideals, including those generated by degree-two monomials and edge ideals of graphs and clutters.
Findings
Normality criteria for monomial ideals established
Criteria for ideals generated by degree-two monomials provided
Normality conditions for edge ideals of graphs and clutters derived
Abstract
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters and their ideals of covers.
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