Stabilization index of V-number of powers of edge ideals of graphs
We provide a combinatorial description of the stabilization index of the $v$-function of powers of edge ideals for arbitrary graphs.
arXiv subjects
Publications and source records attributed to Ha Thi Thu Hien.
We provide a combinatorial description of the stabilization index of the $v$-function of powers of edge ideals for arbitrary graphs.
Let $G$ be a simple connected graph and $t \ge 2$ an integer. We prove that if the maximal homogeneous ideal is an associated prime of the $t$th power of the closed neighborhood ideal of $G$, then the diameter of $G$ is at most $7t - 8$. We further show that this bound is sharp for all $t \ge 2$.
We study simple graphs for which the maximal homogeneous ideal is an associated prime of the second power of their closed neighborhood ideals. In particular, we show that such graphs must have diameter at most $6$, and that those with diameter $2$ must be vertex diameter-$2$-critical.
Let $I$ be the edge ideal of a connected non-bipartite graph and $R$ the base polynomial ring. Then $\operatorname{depth} R/I \ge 1$ and $\operatorname{depth} R/I^t = 0$ for $t \gg 1$. We give combinatorial conditions for $\operatorname{depth} R/I^t = 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 $\operatorname{depth} R/I = 1$ then $\operatorname{depth} R/I^2 = 0$ and if $\operatorname{depth} R/I^2 = 1$ then $\operatorname{depth} R/I^5 = 0$. Other similar results suggest that if $\operatorname{depth} R/I^t = 1$ then $\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 $\operatorname{depth} R/I^{(t)} = 1$ for $t \gg 1$ and show that the condition $\operatorname{depth} R/I^{(t)} = 1$ is persistent, where $I^{(t)}$ denotes the $t$-th symbolic powers of $I$.
To compute the local cohomology of powers of edge ideals one needs to know their saturations. The saturation of the second and third powers has been described in terms of the graph in [13] and [10]. In this article, we give a combinatorial description of the generators of the saturation of the fourth power. As a consequence, we are able to give a complete classification of the associated primes of the fourth power of edge ideals in terms of the graph.
For the edge ideal I of an arbitrary simple graph G we describe the monomials of the saturation of a power of I in terms of (vertex) weighted graphs associated with the monomials. This description allows us to characterize the embedded associated primes of a power of I as covers of G which contain certain types of subgraphs of G. As an application, we completely classify the associated primes of the second and the third power of I in terms of G.