Related papers: Shellability and the strong gcd-condition

Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…

If a pure simplicial complex is partitionable, then its $h$-vector has a combinatorial interpretation in terms of any partitioning of the complex. Given a non-partitionable complex $\Delta$, we construct a complex $\Gamma \supseteq \Delta$…

The goal of this paper is to generalize some of the existing toolkit of combinatorial algebraic topology in order to study the homology of abstract chain complexes. We define shellability of chain complexes in a similar way as for cell…

We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Bj\"orner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We…

We introduce and study strongly vertex dismissible, vertex dismissible, and scalable simplicial complexes as non-pure extensions of vertex decomposability and shellability. Strong vertex dismissibility is defined recursively by relaxing the…

It could be expected that the moment-angle complex associated with a Golod simplicial complex is homotopy equivalent to a suspension space. In this paper, we provide a counter example to this expectation. We have discovered this complex…

We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…

We prove that certain class of Stanley--Reisner rings having sufficiently large multiplicities are Cohen--Macaulay using Alexander duality.

For a graph $G$, Bayer-Denker-Milutinovi\'c-Rowlands-Sundaram-Xue study in \cite{B-D-M-R-S-X} a new graph complex $\Delta_k^t(G)$, namely the simplicial complex with facets that are complements to independent sets of size $k$ in $G$. They…

Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated…

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

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…

In this paper we show that a $k$-shellable simplicial complex is the expansion of a shellable complex. We prove that the face ring of a pure $k$-shellable simplicial complex satisfies the Stanley conjecture. In this way, by applying…

We prove a duality theorem for Cohen--Macaulay simplicial complexes. This is a generalisation of Poincar\'e Duality, framed in the language of combinatorial sheaves. Our treatment is self-contained and accessible for readers with a working…

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…

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…

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…

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…

We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.

We study the homological properties of $\Delta_{\mathbf{r}}(n_1, \dots, n_e)$, a simplicial complex formed by sequentially gluing complete graphs along $(r_i-1)$-simplices. This construction generates precisely the chordal clique complexes,…