相关论文: On the Equality of Symbolic and Ordinary Powers of…

In this paper, we investigate when symbolic and ordinary powers of the parity binomial edge ideal of a graph fail to be equal. It turns out that if $\mathcal{I}_{G}$ is the parity binomial edge ideal of a graph $G$, then in each of the…

We show that under some conditions, if the initial ideal in$_<(I)$ of an ideal $I$ in a polynomial ring has the property that its symbolic and ordinary powers coincide, then the ideal $I$ shares the same property. We apply this result to…

Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we show that all the symbolic and ordinary powers of $I(\mathcal{D})$ coincide when $\mathcal{D}$ is a weighted oriented certain class of…

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…

We consider the following question concerning the equality of ordinary and symbolic powers of ideals. In a regular local ring, if the ordinary and symbolic powers of a one-dimensional prime ideal are the same up to its height, then are they…

In this article, we prove that for several classes of graphs, the Castelnuovo-Mumford regularity of symbolic powers of their edge ideals coincide with that of their ordinary powers.

Let $G$ be a unicyclic graph with edge ideal $I(G)$. For any integer $s\geq 1$, we denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that ${\rm reg}(I(G)^{(s)})={\rm reg}(I(G)^s)$, for every $s\geq 1$.

To a graph $G$ one associates the binomial edge ideal $J_G$ generated by a collection of binomials corresponding to the edges of $G$. In this paper, we study the asymptotic behavior of symbolic powers of $J_G$, its lexicographic initial…

Let $D$ be a weighted oriented graph and $I(D)$ be its edge ideal. If $D$ contains an induced odd cycle of length $2n+1$, under certain condition we show that $ {I(D)}^{(n+1)} \neq {I(D)}^{n+1}$. We give necessary and sufficient condition…

Let $G$ be a graph and let $I = I(G)$ be its edge ideal. When $G$ is unicyclic, we give a decomposition of symbolic powers of $I$ in terms of its ordinary powers. This allows us to explicitly compute the Waldschmidt constant and the…

We prove several cases of the Betti number conjecture for the binomial edge ideal $J_G$ of a proper interval graph $G$ (also known as closed graph). Namely, we show that this conjecture is true for the linear strand of $J_G$, and true in…

Let $G$ be a finite simple graph on $n$ non-isolated vertices, and let $J_G$ be its binomial edge ideal. We determine almost all pairs $(\text{projdim}(J_G),\text{reg}(J_G))$, where $G$ ranges over all finite simple graphs on $n$…

In this article, we study the powers of the generalized binomial edge ideal $\mathcal{J}_{K_m,P_n}$ of a path graph $P_n$. We explicitly compute their regularities and determine the limit of their depths. We also show that these ordinary…

Let $G$ be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that $J(G)$ is the cover ideal $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove…

We study the regularity of small symbolic powers and integral closure of small powers of edge ideals. We also prove that the regularity of integral closure of powers of edge ideals of graphs with at most two odd cycles is the same as the…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of symbolic powers of certain…

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 investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the…

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 cycle or a complete bipartite graph. We show that the binomial edge ideal $J_{G}$ and its initial ideal with respect to the lexicographic order have the same extremal Betti number.