Related papers: Gorenstein Binomial Edge Ideals

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

The v-number of a graded ideal is an algebraic invariant introduced by Cooper et al., and originally motivated by problems in algebraic coding theory. In this paper we study the case of binomial edge ideals and we establish a significant…

We classify all convex polyomino ideals which are linearly related or have a linear resolution. Convex stack polyominoes whose ideals are extremal Gorenstein are also classified. In addition, we characterize, in combinatorial terms, the…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge…

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…

Let $G_\omega$ be an edge-weighted simple graph. In this paper, we give a complete characterization of the graph $G_\omega$ whose edge ideal $I(G_\omega)$ is integrally closed. We also show that if $G_\omega$ is an edge-weighted star graph,…

Let G be a perfect graph and let J be its ideal of vertex covers. We show that the Rees algebra of J is normal and that this algebra is Gorenstein if G is unmixed. Then we give a description--in terms of cliques--of the symbolic Rees…

The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…

Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals…

Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result,…

Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate the generalized binomial edge ideal $J_{m}(G)$ in the polynomial ring $R=K[x_{ij}: i \in [m], j \in [n]]$. We provide a lower bound for the…

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.

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…

Let $A$ be a two-dimensional excellent normal Gorenstein local domain. In this paper, we characterize elliptic ideals $I \subset A$ for its normal tangent cone $\overline{G}(I)$ to be Gorenstein. Moreover, we classify all those ideals in a…

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by $m(G)+1$, where…

In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the…

Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut sets of a graph $G$, special sets of vertices that disconnect…

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$…