Related papers: $(S_2)$-condition and Cohen-Macaulay binomial edge…

Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated…

Let $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

Let G be the circulant graph C_n(S) with S a subset of {1,2,...,\lfloor n/2 \rfloor}, and let I(G) denote its the edge ideal in the ring R = k[x_1,...,x_n]. We consider the problem of determining when G is Cohen-Macaulay, i.e, R/I(G) is a…

Given a tree T on n vertices, there is an associated ideal I of a polynomial ring in n variables over a field, generated by all paths of a fixed length of T. We show that such an ideal always satisfies the Konig property and classify all…

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

We define a simple graph as compact if it lacks even cycles and satisfies the odd-cycle condition. Our focus is on classifying all compact graphs and examining the characteristics of their edge rings. Let $G$ be a compact graph and…

Let $G$ be a finite simple graph on the vertex set $[n] = \{ 1, \ldots, n \}$ and $K[X, Y] = K[x_1, \ldots, x_n, y_1, \ldots, y_n]$ the polynomial ring in $2n$ variables over a field $K$ with each $\mathrm{deg} x_i = \mathrm{deg} y_j = 1$.…

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…

Let $J_G$ denote the binomial edge ideal of a connected undirected graph on $n$ vertices. This is the ideal generated by the binomials $x_iy_j - x_jy_i, 1\leq i < j \leq n,$ in the polynomial ring $S= K[x_1,...,x_n,y_1,...,y_n]$ where…

We prove that level binomial edge ideals with regularity 2 and pseudo-Gorenstein binomial edge ideals with regularity 3 are cones, and we describe them completely. Also, we characterize level and pseudo-Gorenstein binomial edge ideals of…

In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…

We give a necessary and sufficient condition for a simplicial complex to be approximately Cohen-Macaulay. Namely it is approximately Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear and…

Let $K$ be a field and $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$. Let $\Delta$ be a simplicial complex on $n$ vertices and $I=I_{\Delta}$ be its Stanley-Reisner ideal. In this paper, we show that if $I$…

Let $G$ be a simple graph on the vertex set $V(G) = [n] = \{1,...,n\}$ and edge ideal $E(G)$. We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges $\{i, j\}$ and $\{k,…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…

In this paper, we characterize the Cohen-Macaulayness of the second power $I(G_\omega)^2$ of the weighted edge ideal $I(G_\omega)$ when the underlying graph $G$ is a very well-covered graph. We also characterize the Cohen-Macaulayness of…

A decorated surface S is an oriented surface with punctures and a finite set of marked points on the boundary, such that each boundary component has a marked point. We introduce ideal bipartite graphs on S. Each of them is related to a…

Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…

In this paper, we prove that the open neighborhood ideal of a TD-unmixed tree is geometrically vertex decomposable. This result implies that the associated Stanley-Reisner complex is vertex decomposable. We further demonstrate that…