Related papers: Cohen-Macaulay Monomial Ideals of Codimension 2

We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

Let $I$ be the edge ideal of a Cohen-Macaulay tree of dimension $d$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{d},y_1,\ldots,y_d]$. We prove that for all $t \ge 1$, $$\operatorname{depth} (S/I^t) = \operatorname{max} \{d -t + 1, 1…

LCM lattices were introduced by Gasharov, Peeva, and Welker as a way to study minimal free resolutions of monomial ideals. All LCM lattices are atomic and all atomic lattices arise as the LCM lattice of some monomial ideal. We…

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.

We compute the minimal primary decomposition for completely squarefree lexsegment ideals. We show that critical squarefree monomial ideals are sequentially Cohen-Macaulay. As an application, we give a complete characterization of the…

A theorem of Macaulay on colons of ideals in polynomial rings is proved for homogeneous Gorenstein algebras.

Let $I$ be a monomial ideal of a polynomial ring $R=K[x_1,\ldots,x_n]$ over a field $K$ and let ${\rm sgn}(I)$ be its signature ideal. If $I$ is not a principal ideal, we show that the depth of $R/I$ is the depth of $R/{\rm sgn}(I)$, and…

If $I$ is a perfect ideal in a local Cohen-Macaulay ring, the generators of ideals linked to $I$ are well understood. However, the generators of the residual intersections of $I$ have only been computed in a few special cases. In this…

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…

We describe the structure of the monoid of natural-valued monotone functions on an arbitrary poset. For this monoid we provide a presentation, a characterization of prime elements, and a description of its convex hull. We also study the…

Let X be a polyhedral complex with finitely many isometry classes of links. We establish a restriction on the covolumes of uniform lattices acting on X. When X is two-dimensional and has all links isometric to either a complete bipartite…

In this paper, we introduce the concept of $k$-clean monomial ideals as an extension of clean monomial ideals and present some homological and combinatorial properties of them. Using the hierarchal structure of $k$-clean ideals, we show…

We study relations between the Cohen-Macaulay property and the positivity of $h$-vectors, showing that these two conditions are equivalent for those locally Cohen-Macaulay equidimensional closed projective subschemes $X$, which are close to…

A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…

In this article we study minimal free resolutions of Gorenstein ideals of codimension four, using methods coming from representation theory. We introduce families of higher structure maps associated with such resolution, defined similarly…

A tetrahedral curve is a (usually nonreduced) curve in P^3 defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using…

In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$…