Binomial edge ideals of Clutters
Kamalesh Saha, Indranath Sengupta
TL;DR
This paper extends the concept of binomial edge ideals from graphs to clutters, providing new results and addressing an open question in the field.
Contribution
It introduces binomial edge ideals for clutters and offers analogous results to graph cases, including resolving a previously posed question.
Findings
Established binomial edge ideals for clutters.
Derived properties similar to those in graph theory.
Answered an open question from prior research.
Abstract
In this paper, we introduce the notion of binomial edge ideals of a clutter and obtain results similar to those obtained for graphs by Rauf \& Rinaldo in \cite{raufrin}. We also answer a question posed in their paper.
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 · Rings, Modules, and Algebras