相关论文: The projective dimension of sequentially Cohen-Mac…

The study of the edge ideal $I(D_{G})$ of a weighted oriented graph $D_{G}$ with underlying graph $G$ started in the context of Reed-Muller type codes. We generalize a Cohen-Macaulay construction for $I(D_{G})$, which Villarreal gave for…

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

The homological shift algebra and the projective dimension function of complementary edge ideals are investigated. Let $G$ be a connected graph, and let $I$ be its complementary edge ideal. For bipartite graphs $G$, we show that the…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. Suppose that $\mathcal{C}$ is a chordal clutter with $n$ vertices and assume that the minimum edge…

Let $I\subset R=K[x_1, \ldots, x_n]$ be a square-free monomial ideal, $\mathfrak{q}$ be a prime monomial ideal in $R$, $h$ be a square-free monomial in $R$ with $\mathrm{supp}(h) \cap (\mathrm{supp}(\mathfrak{q}) \cup…

In this paper, we prove the degree upper bound of projective subschemes in terms of the reduction number and show that the maximal cases are only arithmetically Cohen-Macaulay subschemes with linear resolution. Furthermore, it can be shown…

Let $k$ be a field and $x,y$ indeterminates over $k$. Let $R=k[x^a,x^{p_1}y^{s_1},\ldots,x^{p_t}y^{s_t},y^b] \subseteq k[x,y]$. We calculate the Hilbert polynomial of $(x^a,y^b)$. The multiplicity of this ideal provides part of a criterion…

Let $M$ be an $R$-module over a Noetherian ring $R$ and $\mathfrak{a}$ be an ideal of $R$ with $c={\rm cd}(\mathfrak{a},M)$. First, we prove that $M$ is finite $\mathfrak{a}$-relative Cohen-Macaulay if and only if ${\rm…

The classes of sequentially Cohen-Macaulay and sequentially homotopy Cohen-Macaulay complexes and posets are studied. First, some different versions of the definitions are discussed and the homotopy type is determined. Second, it is shown…

Given a simplicial complex, it is easy to construct a generic deformation of its Stanley-Reisner ideal. The main question under investigation in this paper is how to characterize the simplicial complexes such that their Stanley-Reisner…

We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.

We define what it means for a Cohen-Macaulay ring to to be super-stretched and show that Cohen-Macaulay rings of graded countable Cohen-Macaulay type are super-stretched. We use this result to show that rings of graded countable…

A long-standing conjecture of Stanley states that every Cohen-Macaulay simplicial complex is partitionable. We disprove the conjecture by constructing an explicit counterexample. Due to a result of Herzog, Jahan and Yassemi, our…

This paper is a sequel to [8] where we introduced an invariant, called canonical degree, of Cohen-Macaulay local rings that admit a canonical ideal. Here to each such ring with a canonical ideal, we attach a different invariant, called…

We characterize pure lexsegment complexes which are Cohen-Macaulay in arbitrary codimension. More precisely, we prove that any lexsegment complex is Cohen-Macaulay if and only if it is pure and its one dimensional links are connected, and,…

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…

We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in…

In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to vertex weighted rooted forests and oriented cycles. As some consequences, we give some exact formulas for the depth of…

Let $R=k[x_{1},\ldots,x_{n}]$, where $k$ is a field. The path ideal (of length $t\geq 2$) of a directed graph $G$ is the monomial ideal, denoted by $I_{t}(G)$, whose generators correspond to the directed paths of length $t$ in $G$. Let…