Licci binomial edge ideals
Viviana Ene, Giancarlo Rinaldo, Naoki Terai
TL;DR
This paper characterizes graphs with licci binomial edge ideals and introduces a new upper bound for their regularity, advancing understanding in algebraic graph theory.
Contribution
It provides a complete characterization of graphs with licci binomial edge ideals and proposes a novel upper bound for their regularity.
Findings
Characterization of graphs with licci binomial edge ideals
Introduction of a new upper bound for regularity
Enhanced understanding of algebraic properties of graph ideals
Abstract
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
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