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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本