We extend a reciprocity theorem of Stanley about enumeration of integer points in polyhedral cones when one exchanges strict and weak inequalities. The proof highlights the roles played by Cohen-Macaulayness and canonical modules. The extension raises the issue of whether a Cohen-Macaulay complex of dimension d embedded piecewise-linearly in d-space is necessarily a d-ball. This is observed to be true for d at most 3, but false for d=4.
All Cohen--Macaulay polymatroidal ideals are classified. The Cohen--Macaulay polymatroidal ideals are precisely the principal ideals, the Veronese ideals, and the squarefree Veronese ideals.
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable bi-Cohen-Macaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.
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 Cohen-Macaulay. We show that many interesting examples of Cohen-Macaulay complexes in combinatorics are minimal, including Rudin's ball, Ziegler's ball, the dunce hat, and recently discovered non-partitionable Cohen-Macaulay complexes. We further provide various ways to construct such complexes.
We study the Cohen-Macaulay property of triangular graphs $T_n$. We show that $T_2$, $T_3$ and $T_5$ are Cohen-Macaulay graphs, and that $T_4$, $T_6$, $T_8$ and $T_n$ are not Cohen-Macaulay graphs, for $n\geq 10$. Finally, we prove that over fields of characteristic zero $T_7$ and $T_9$ are Cohen-Macaulay.
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 only if it is almost Cohen-Macaulay.
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 how various constructions, such as join, product and rank-selection preserve these properties. Third, a characterization of sequential Cohen-Macaulayness for posets is given. Finally, in an appendix we outline connections with ring-theory and survey some uses of sequential Cohen-Macaulayness in commutative algebra.
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, a lexsegment flag complex is Cohen-Macaulay if and only if it is pure and connected. We show that any non-Cohen-Macaulay lexsegment complex is a Buchsbaum complex if and only if it is a pure disconnected flag complex. For $t\ge 2$, a lexsegment complex is strictly Cohen-Macaulay in codimension $t$ if and only if it is the join of a lexsegment pure disconnect…
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 their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes and Toledo.
In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $°(v) \leq 2$. In particular, if $G$ is an almost Cohen-Macaulay bipartite graph and $u$ is a vertex of degree one of $G$ and $v$ its adjacent vertex, then $G\setminus\{v\}$ is almost Cohen-Macaulay. Also, we show that an unmixed Ferrers graph is almost Cohen-Macaulay if and only if it is connected in codimension two. Moreover, we give some examples.
Let $I(G)$ be the edge ideal of a simple graph $G$. In this paper, we will give sufficient and necessary combinatorial conditions of $G$ in which the second symbolic and ordinary power of its edge ideal are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay). As an application of our results, we will classify all bipartite graphs in which the second (symbolic) powers are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay).
In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of size $r$, then the clique cover is unique.
We introduce a new family of graphs, namely, hybrid graphs. There are infinitely many hybrid graphs associated to a single graph. We show that every hybrid graph associated to a given graph is Cohen Macaulay. Furthermore, we show that every CohenMacaulay chordal graph is a hybrid graph.
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.
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 Cohen-Macaulay ring. Because a Cohen-Macaulay graph G must be well-covered, we focus on known families of well-covered circulant graphs of the form C_n(1,2,...,d). We also characterize which cubic circulant graphs are Cohen-Macaulay. We end with the observation that even though the well-covered property is preserved under lexicographical products of graphs, t…
Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $J$ be a matroidal ideal of degree $d$ in $R$. In this paper, we study the class of sequentially Cohen-Macaulay matroidal ideals. In particular, all sequentially Cohen-Macaulay matroidal ideals of degree $2$ are classified. Furthermore, we give a classification of sequentially Cohen-Macaulay matroidal ideals of degree $d\geq 3$ in some special cases.
We examine virtual resolutions of Stanley-Reisner ideals for a product of projective spaces. In particular, we provide sufficient conditions for a simplicial complex to be virtually Cohen-Macaulay (to have a virtual resolution with length equal to its codimension). We also show that all balanced simplicial complexes are virtually Cohen-Macaulay.
Let $G$ be an unmixed bipartite graph of dimension $d-1$. Assume that $K_{n,n}$, with $n\ge 2$, is a maximal complete bipartite subgraph of $G$ of minimum dimension. Then $G$ is Cohen-Macaulay in codimension $d-n+1$. This generalizes a characterization of Cohen-Macaulay bipartite graphs by Herzog and Hibi and a result of Cook and Nagel on unmixed Buchsbaum graphs. Furthermore, we show that any unmixed bipartite graph $G$ which is Cohen-Macaulay in codimension $t$, is obtained from a Cohen-Macaulay graph by replacing certain edges of $G$ with complete bipartite graphs. We provide some examples.
Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi's theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and implies Herzog, Hibi, and Zheng's theorem that a chordal graph is Cohen-Macaulay if and only if its edge ideal is unmixed. We also characterize the sequentially Cohen-Macaulay cycles and produce some ex…
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 generated in two consecutive degrees. This completes the result of Herzog and Hibi who proved that a simplicial complex is sequentially Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear.
Starting from an unpublished conjecture of Kalai and from a conjecture of Eisenbud, Green and Harris, we study several problems relating h-vectors of Cohen-Macaulay, flag simplicial complexes and face vectors of simplicial complexes.
In this paper we discuss the problem of characterizing the Cohen-Macaulay property of certain families of monomial ideals with fixed radical. More precisely, we consider generically complete intersection monomial ideals whose radical corresponds to special classes of simplicial complexes.
We classify Cohen-Macaulay graphs of girth at least $5$ and planar Gorenstein graphs of girth at least $4$. Moreover, such graphs are also vertex decomposable.
We consider a class of graphs $G$ such that the height of the edge ideal $I(G)$ is half of the number $\sharp V(G)$ of the vertices. We give Cohen-Macaulay criteria for such graphs.
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a criterion for the Cohen-Macaulayness of facet ideals of simplicial trees. Along the way, we generalize several concepts from graph theory to simplicial complexes.
In this paper we show that if the Stanley-Reisner ring of the simplicial complex of independent sets of a bipartite graph $G$ satisfies Serre's condition $S_2$, then $G$ is Cohen-Macaulay. As a consequence, the characterization of Cohen-Macaulay bipartite graphs due to Herzog and Hibi carries over this family of bipartite graphs. We check that the equivalence of Cohen-Macaulay property and the condition $S_2$ is also true for chordal graphs and we classify cyclic graphs with respect to the condition $S_2$.
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 binomial edge ideals are Cohen-Macaulay and unmixed. So that we generalize the results of Ene, Herzog and Hibi on block graphs. Moreover, we study unmixedness and Cohen-Macaulayness of the binomial edge ideal of some graph products such as the join and corona of two graphs with respect to the original graphs'.
Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equivalent in this graphs. Also, we obtain an equivalent condition for Cohen-Macaulay in complete t-partite graphs.
Let P be a lattice polytope with $h^*$-vector $(1, h^*_1, h^*_2)$. In this note we show that if $h_2^* \leq h_1^*$, then $P$ is IDP. More generally, we show the corresponding statements for semi-standard graded Cohen-Macaulay domains over algebraically closed fields.
Let G be a bipartite graph with edge ideal I(G) whose quotient ring R/I(G) is sequentially Cohen-Macaulay. We prove: (1) the independence complex of G must be vertex decomposable, and (2) the Castelnuovo-Mumford regularity of R/I(G) can be determined from the invariants of G.
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In particular it is shown that a directed graph is transitive iff a corresponding undirected graph is Cohen-Macaulay.
We show that if a $d$-dimensional Cohen-Macaulay complex is, in a certain sense, sufficiently "close" to being balanced, then there is a $d$-dimensional balanced Cohen-Macaulay complex having the same $f$-vector. This in turn provides some partial evidence for a conjecture of Kalai on the $f$-vectors of Cohen-Macaulay flag complexes.
The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of the same rank. A corresponding notion of edgewise Cohen--Macaulay connectivity for partially ordered sets is investigated. Examples and open questions are discussed.
A certain inequality is shown to hold for the values of the Mobius function of the poset obtained by attaching a maximum element to a lower Eulerian Cohen-Macaulay poset. In two important special cases, this inequality provides partial results supporting Stanley's nonnegativity conjecture for the toric h-vector of a lower Eulerian Cohen-Macaulay meet-semilattice and Adin's nonnegativity conjecture for the cubical h-vector of a Cohen-Macaulay cubical complex.
Via the BGG correspondence a simplicial complex Delta on [n] is transformed into a complex of coherent sheaves on P^n-1. We show that this complex reduces to a coherent sheaf F exactly when the Alexander dual Delta^* is Cohen-Macaulay. We then determine when both Delta and Delta^* are Cohen-Macaulay. This corresponds to F being a locally Cohen-Macaulay sheaf. Lastly we conjecture for which range of invariants of such Delta it must be a cone.
