English

Decreasing behavior of the depth functions of edge ideals

Commutative Algebra 2023-01-24 v2 Combinatorics

Abstract

Let II be the edge ideal of a connected non-bipartite graph and RR the base polynomial ring. Then depthR/I1\operatorname{depth} R/I \ge 1 and depthR/It=0\operatorname{depth} R/I^t = 0 for t1t \gg 1. We give combinatorial conditions for depthR/It=1\operatorname{depth} R/I^t = 1 for some tt 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 depthR/I=1\operatorname{depth} R/I = 1 then depthR/I2=0\operatorname{depth} R/I^2 = 0 and if depthR/I2=1\operatorname{depth} R/I^2 = 1 then depthR/I5=0\operatorname{depth} R/I^5 = 0. Other similar results suggest that if depthR/It=1\operatorname{depth} R/I^t = 1 then depthR/It+3=0\operatorname{depth} R/I^{t+3} = 0. 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 depthR/I(t)=1\operatorname{depth} R/I^{(t)} = 1 for t1t \gg 1 and show that the condition depthR/I(t)=1\operatorname{depth} R/I^{(t)} = 1 is persistent, where I(t)I^{(t)} denotes the tt-th symbolic powers of II.

Keywords

Cite

@article{arxiv.2212.14792,
  title  = {Decreasing behavior of the depth functions of edge ideals},
  author = {Ha Thi Thu Hien and Ha Minh Lam and Ngo Viet Trung},
  journal= {arXiv preprint arXiv:2212.14792},
  year   = {2023}
}

Comments

15 pages, 3 figures