The size of the Betti table of Binomial Edge Ideals
Antonino Ficarra, Emanuele Sgroi

TL;DR
This paper investigates the algebraic properties of binomial edge ideals associated with finite simple graphs, specifically focusing on the size of their Betti tables by analyzing projective dimension and regularity across all such graphs.
Contribution
It provides a comprehensive determination of almost all pairs of projective dimension and regularity for binomial edge ideals of graphs with a fixed number of vertices.
Findings
Almost all pairs of projective dimension and regularity are characterized.
Results apply to all finite simple graphs with non-isolated vertices.
The study advances understanding of the algebraic invariants of binomial edge ideals.
Abstract
Let be a finite simple graph on non-isolated vertices, and let be its binomial edge ideal. We determine almost all pairs , where ranges over all finite simple graphs on non-isolated vertices, for any .
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 · Synthesis of Indole Derivatives · Polynomial and algebraic computation
