Decreasing behavior of the depth functions of edge ideals
Commutative Algebra
2023-01-24 v2 Combinatorics
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 for and show that the condition is persistent, where denotes the -th symbolic powers of .
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