Decreasing behavior of the depth functions of edge ideals
Ha Thi Thu Hien, Ha Minh Lam, Ngo Viet Trung

TL;DR
This paper investigates the decreasing behavior of depth functions of edge ideals of connected non-bipartite graphs, providing combinatorial conditions for depth values and revealing surprising relationships between depths of different powers.
Contribution
It introduces combinatorial criteria for when the depth of powers of edge ideals equals 1 and demonstrates the rapid decrease of depth to zero, including for symbolic powers.
Findings
Depth function decreases to 0 after reaching 1
If depth of R/I is 1, then depth of R/I^2 is 0
Depth of symbolic powers also exhibits similar behavior
Abstract
Let be the edge ideal of a connected non-bipartite graph and the base polynomial ring. Then and for . We give combinatorial conditions for for some in between and show that the depth function is non-increasing thereafter. Especially, the depth function quickly decreases to 0 after reaching 1. We show that if then and if then . Other similar results suggest that if then . This a surprising phenomenon because the depth of a power can determine a smaller depth of another power. Furthermore, we are able to give a simple combinatorial criterion for $\operatorname{depth} R/I^{(t)}…
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
