Related papers: Cohen-Macaulay admissible clutters

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…

Rank 2 indecomposable arithmetically Cohen-Macaulay bundles E on a nonsingular cubic surface X in P^3 are classified, by means of the possible forms taken by the minimal graded free resolution of E over P^3. The admissible values of the…

We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of…

We consider the fiber cone of monomial ideals. It is shown that for monomial ideals $I\subset K[x,y]$ of height $2$, generated by $3$ elements, the fiber cone $F(I)$ of $I$ is a hypersurface ring, and that $F(I)$ has positive depth for…

Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…

Let $D$ be a weighted oriented graph, whose underlying graph is $G$, and let $I(D)$ be its edge ideal. If $G$ has no $3$-, $5$-, or $7$-cycles, or $G$ is K\"{o}nig, we characterize when $I(D)$ is unmixed. If $G$ has no $3$- or $5$-cycles,…

The purpose of this paper is to present a family of Cohen-Macaulay monomial ideals such that their integral closures have embedded components and hence are not Cohen-Macaulay.

For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $…

Let I=(x^{v_1},...,x^{v_q} be a square-free monomial ideal of a polynomial ring K[x_1,...,x_n] over an arbitrary field K and let A be the incidence matrix with column vectors {v_1},...,{v_q}. We will establish some connections between…

Cohen Macaulay property of fiber cones of ideals is characterized in terms of its Hilbert series. Hilbert series of fiber cones of ideals with minimal mixed multiplicity is calculated. It is proved that the fiber cone of an m-primary ideal…

A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…

We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give sufficient conditions for a complex to be minimal…

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be monomial ideal of $R$. In this paper, we show that if $I$ is a generic monomial ideal, then $R/I$ is pretty clean if and only if $R/I$ is…

In this paper, we give a new criterion for the Cohen-Macaulayness of vertex splittable ideals, a family of monomial ideals recently introduced by Moradi and Khosh-Ahang. Our result relies on a Betti splitting of the ideal and provides an…

We present criteria for the Cohen-Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen-Macaulayness of monomial ideals…

A tame ideal is an ideal $I$ such that the blowup of the affine space $\mathbb{A}_k^n$ along $I$ is regular. In this paper, we give a combinatorial characterization of tame squarefree monomial ideals. More precisely, we show that a square…

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…

This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$…

We introduce 2-partitionable clutters as the simplest case of the class of $k$-partitionable clutters and study some of their combinatorial properties. In particular, we study properties of the rank of the incidence matrix of these clutters…

Some well-known arithmetically Cohen-Macaulay configurations of linear varieties in $\mathbb{P}^r$ as $k$-configurations, partial intersections and star configurations are generalized by introducing tower schemes. Tower schemes are reduced…