Decreasing behavior of the depth functions of edge ideals

Abstract

Let I be the edge ideal of a connected non-bipartite graph and R the base polynomial ring. Then depth R/I 1 and depth R/It = 0 for t 1. We give combinatorial conditions for depth R/It = 1 for some t 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 depth R/I = 1 then depth R/I2 = 0 and if depth R/I2 = 1 then depth R/I5 = 0. Other similar results suggest that if depth R/It = 1 then depth R/It+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 depth R/I(t) = 1 for t 1 and show that the condition depth R/I(t) = 1 is persistent, where I(t) denotes the t-th symbolic powers of I.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…