Search

We prove that the regularity cannot increase when taking the integral closure for edge ideals of arbitrary weighted oriented graphs.

Let $G$ be a simple graph on $n$ vertices. We introduce the notion of bipartite connectivity of $G$, denoted by $\operatorname{bc}(G)$ and prove that $$\lim_{s \to \infty} \operatorname{depth} (S/I(G)^{(s)}) \le \operatorname{bc}(G),$$ where $I(G)$ denotes the edge ideal of $G$ and $S = \mathrm{k}[x_1, \ldots, x_n]$ is a standard graded polynomial ring over a field $\mathrm{k}$. We further compute the depth of symbolic powers of edge ideals of several classes of graphs, including odd cycles and whisker graphs of complete graphs to illustrate the cases where the above inequality becomes equality., Comment: Accepted for publication in the Pacific Journal of Mathematics

Let $I(G_{\mathbf{w}})$ be the edge ideal of an edge-weighted graph $(G,\mathbf{w})$. We prove that $I(G_{\mathbf{w}})$ is sequentially Cohen-Macaulay for all weight functions $w$ if and only if $G$ is a Woodroofe graph., Comment: 8 pages, submitted for publication

Let $I$ be the edge ideal of a cycle of length $n \ge 5$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_n]$. We prove that for $2 \le t < \lceil (n+1)/2 \rceil$, $$\operatorname{depth} (S/I^t) = \lceil \frac{n -t + 1}{3} \rceil.$$ When $G = T_{\mathbf{a}}$ is a starlike tree which is the join of $k$ paths of length $a_1, \ldots, a_k$ at a common root $1$, we give a formula for the depth of powers of $I(T_{\mathbf{a}})$.

Let $I(G)$ be the edge ideal of a simple graph $G$. We prove that $I(G)^2$ has a linear free resolution if and only if $G$ is gap-free and reg$I(G) \le 3$. Similarly, we show that $I(G)^3$ has a linear free resolution if and only if $G$ is gap-free and reg$I(G) \le 4$. We deduce these characterizations from a general formula for the regularity of powers of edge ideals of gap-free graphs $${\rm reg}(I(G)^s) = \max({\rm reg} I(G) + s-1,2s),$$ for $s =2,3$., Comment: 14 pages. Update a proof of Theorem 2.13 with a statement for a squarefree monomial ideal. arXiv admin note: text overlap with arXiv:2109.06396

Let $I(G)$ be the edge ideal of a simple graph $G$ over a field k. We prove that $${\rm reg}(\overline {I(G)^s}) = {\rm reg}(I(G)^s),$$ for all $s \le 4$. Furthermore, we provide an example of a graph $G$ such that $${\rm reg} I(G)^s = {\rm reg} \overline{I(G)^s} = {\rm reg} I(G)^{(s)} = \begin{cases} 5 + 2s & \text{ if char k} = 2 \\ 4 + 2s & \text{ if char k} \neq 2, \end{cases}$$ for all $s \ge 1.$, Comment: 22 pages. arXiv admin note: text overlap with arXiv:2109.06396, arXiv:2109.05242. Add a section about integral closure of powers of Stanley-Reisner ideals of one-dimensional simplicial complexes

Let $\Delta$ be a one-dimensional simplicial complex. Let $I_\Delta$ be the Stanley-Reisner ideal of $\Delta$. We prove that for all $s \ge 1$ and all intermediate ideals $J$ generated by $I_\Delta^s$ and some minimal generators of $I_\Delta^{(s)}$, we have $${\rm reg} J = {\rm reg} I_\Delta^s = {\rm reg} I_\Delta^{(s)}.$$, Comment: 19 pages, submitted

Let $G$ be a simple graph and $I$ its edge ideal. We prove that $${\rm reg}(I^{(s)}) = {\rm reg}(I^s)$$ for $s = 2,3$, where $I^{(s)}$ is the $s$-th symbolic power of $I$. As a consequence, we prove the following bounds \begin{align*} {\rm reg} I^{s} & \le {\rm reg} I + 2s - 2, \text{ for } s = 2,3, {\rm reg} I^{(s)} & \le {\rm reg} I + 2s - 2,\text{ for } s = 2,3,4. \end{align*}, Comment: 24 pages, submitted

Let $\Delta$ be a simplicial complex of a matroid $M$. In this paper, we explicitly compute the regularity of all the symbolic powers of a Stanley-Reisner ideal $I_\Delta$ in terms of combinatorial data of the matroid $M$. In order to do that, we provide a sharp bound between the arboricity of $M$ and the circumference of its dual $M^*$.

Let $I(G)$ be the edge ideal of a simple graph $G$. In this paper, we will give sufficient and necessary combinatorial conditions of $G$ in which the second symbolic and ordinary power of its edge ideal are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay). As an application of our results, we will classify all bipartite graphs in which the second (symbolic) powers are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay)., Comment: 16 pages, to appear in JCTA

We classify Cohen-Macaulay graphs of girth at least $5$ and planar Gorenstein graphs of girth at least $4$. Moreover, such graphs are also vertex decomposable., Comment: 14 pages, to appear in JAA. This is a revised version of http://arxiv.org/abs/1204.5561

We present criteria for the Cohen-Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen-Macaulayness of monomial ideals which are intersections of prime ideal powers. We can characterize the Cohen-Macaulayness of the second symbolic power or of all symbolic powers of a Stanley-Reisner ideal in terms of the simplicial complex. These characterizations show that the simplicial complex must be very compact if some symbolic power is Cohen-Macaulay. In particular, all symbolic powers are Cohen-Macaulay if and only if the simplicial complex is a matroid complex. We also prove that the Cohen-Macaulayness can pass from a symbolic power to another symbolic powers in different ways., Comment: The published version of this paper contains a gap in the proofs of Theorem 2.5 and Theorem 3.5. This version corrects the proofs with almost the same arguments. Moreover, we have to modify the definition of tight complexes in Theorem 2.5. These changes don't affect other things in the published version. A corrigendum has been sent to the journal

Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal in terms of the associated graph., Comment: 9 pages

This paper proves that the Castelnuovo-Mumford regularities of the product and sum of two monomial complete intersection ideals are at most the sum of the regularities of the two ideals, and provides examples showing that these inequalities do not hold for general complete intersections., Comment: 10 pages