Related papers: Regularity of Powers and symbolic powers of edge i…

We classify all unicycle graphs whose edge-binomials form a $d$-sequence, particularly linear type binomial edge ideals. We also classify unicycle graphs whose parity edge-binomials form a $d$-sequence. We study the regularity of powers of…

Let $I = I(G)$ be the edge ideal of a graph $G$. We give various general upper bounds for the regularity function $\text{reg} I^s$, for $s \ge 1$, addressing a conjecture made by the authors and Alilooee. When $G$ is a gap-free graph and…

We study the regularity of binomial edge ideals. For a closed graph $G$ we show that the regularity of the binomial edge ideal $J_G$ coincides with the regularity of $\ini_{\lex}(J_G)$ and can be expressed in terms of the combinatorial data…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. For all $s \geq 1$, we obtain upper bounds for reg$(I(G)^s)$ for bipartite graphs. We then compare the properties of $G$ and $G'$, where $G'$ is the graph…

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

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…

In this paper, we define (im, reg)-invariant extension of graphs and propose a new approach for Nevo and Peeva's conjecture which said that for any gap-free graph $G$ with $reg(I(G)) = 3$ and for any $k \geq 2$, $I(G)^k$ has a linear…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…

Let $G$ be a finite simple graph and $J(G)$ denote its cover ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we show that all symbolic powers of cover ideals of certain vertex decomposable graphs have linear quotients.…

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…

Let $k\geq 3$ be an integer and $G$ be a very well-covered graph with ${\rm odd-girth}(G)\geq 2k+1$. Assume that $I(G)$ is the edge ideal of $G$. We show that for every integer $s$ with $1\leq s\leq k-2$, we have ${\rm…

Assume that $G$ is a graph with cover ideal $J(G)$. For every integer $k\geq 1$, we denote the $k$-th symbolic power of $J(G)$ by $J(G)^{(k)}$. We provide a sharp upper bound for the regularity of $J(G)^{(k)}$ in terms of the star packing…

In this paper, we investigate some properties of symbolic powers and symbolic Rees algebras of binomial edge ideals associated with some classes of block graphs. First, it is shown that symbolic powers of binomial edge ideals of pendant…

In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals of vertex-weighted oriented unicyclic graphs. These formulas are in function of the weight of the vertices, the numbers of edges. We…

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…

We survey classical and recent results on symbolic powers of ideals. We focus on properties and problems of symbolic powers over regular rings, on the comparison of symbolic and regular powers, and on the combinatorics of the symbolic…

The aim of this work is to compare symbolic and ordinary powers of monomial ideals using commutative algebra and combinatorics. Monomial ideals whose symbolic and ordinary powers coincide are called Simis ideals. Weighted monomial ideals…

In this paper we study the $s$-th symbolic powers of the edge ideals of complete graphs. In particular, we provide a criterion for finding an Eliahou-Kervaire splitting on these ideals, and use the splitting to provide a description for the…

Given a nontrivial homogeneous ideal $I\subseteq k[x_1,x_2,\ldots,x_d]$, a problem of great recent interest has been the comparison of the $r$th ordinary power of $I$ and the $m$th symbolic power $I^{(m)}$. This comparison has been…