相关论文: Cohen-Macaulayness of vertex splittable monomial i…

In this article, we give combinatorial formulas for the regularity and the projective dimension of $3$-path ideals of chordal graphs, extending the well-known formulas for the edge ideals of chordal graphs given in terms of the induced…

We consider vector-spread Borel ideals. We show that these ideals have linear quotients and thereby we determine the graded Betti numbers and the bigraded Poincar\'e series. A characterization of the extremal Betti numbers of such a class…

Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial…

Let $R = k[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $k$ and let $I$ be a monomial ideal of $R$. In this paper, we study almost Cohen-Macaulay simplicial complex. Moreover, we characterize the almost…

We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…

Hochster's and Takayama's formulas describes the multigraded components of local cohomology modules of monomial ideals in terms of simplicial complexes. In this paper, we develop a relative version of these formulas for quotients $I/J$ of…

Conca and Varbaro (Invent. Math. 221 (2020), no. 3) showed the equality of depth of a graded ideal and its initial ideal in a polynomial ring when the initial ideal is square-free. In this paper, we give some beautiful applications of this…

A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its…

Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being…

In this paper we consider the problem of finding explicitly canonical ideals of one-dimensional Cohen-Macaulay local rings. We show that Gorenstein ideals contained in a high power of the maximal ideal are canonical ideals. In the…

We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.

We construct a generalize Ishida complex to compute the local cohomology with monomial support of modules over quotients of polynomial rings by cellular binomial ideals. As a consequence, we obtain a combinatorial criterion to determine…

We study the family of ideals defined by mixed size minors of two-sided ladders of indeterminates. We compute their Groebner bases with respect to a skew-diagonal monomial order, then we use them to compute the height of the ideals. We show…

We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K\"onig type which include the edge ideals of K\"onig graphs. We show that a monomial ideal is of K\"onig type if and…

In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…

We provide algorithmic methods to check the Cohen--Macaulayness, Buchsbaumness and/or Gorensteiness of some families of semigroup rings that are constructed from the dilation of bounded convex polyhedrons of $\R^3_{\geq}$. Some families of…

We graph-theoretically characterize triangle-free Gorenstein graphs $G$. As an application, we classify when $I(G)^2$ is Cohen-Macaulay.

Let $G$ be a finite simple graph on a vertex set $V(G)=\{x_{11}, \ldots, x_{n1}\}$. Also let $m_1, \ldots,m_n \geq 2$ be integers and $G_1, \ldots, G_n$ be connected simple graphs on the vertex sets $V(G_i)=\{x_{i1}, \ldots, x_{im_i}\}$. In…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

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…