Scinovex
article Open AccessTop 10% cited

Shellable and Cohen-Macaulay partially ordered sets

Transactions of the American Mathematical Society · 1980 · Vol. 260(1) · pp. 159–183

Abstract

In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of chains is shellable. It is shown that all admissible lattices (including all finite semimodular and supersolvable lattices) and all bounded locally semimodular finite posets are shellable. A technique for labeling the edges of the Hasse diagram of certain lattices, due to R. Stanley, is generalized to posets and shown to imply shellability, while Stanley’s main theorem on the Jordan-HÖlder sequences of such labelings remains valid. Further, we show a number of ways in which shellable posets can be constructed from other shellable posets and complexes. These results give rise to several new examples of Cohen-Macaulay posets. For instance, the lattice of subgroups of a finite group <italic>G</italic> is Cohen-Macaulay (in fact shellable) if and only if <italic>G</italic> is supersolvable. Finally, it is shown that all the higher order complexes of a finite planar distributive lattice are shellable.

Commutative Algebra and Its ApplicationsTopological and Geometric Data AnalysisAdvanced Combinatorial MathematicsMathematicsCombinatoricsPartially ordered setStar productBounded functionLattice (music)Mathematical analysis
Citations
457
FWCI
11.34
field-weighted impact
References
22
Percentile
99%
vs. same field & year
Citations per year
Cited by
Shellable Nonpure Complexes and Posets. I
Transactions of the American Mathematical Society · 1996 · 508 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.

Shellable and Cohen-Macaulay partially ordered sets · Scinovex