Shellable and Cohen-Macaulay partially ordered sets

  • Björner A
337Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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 G is Cohen-Macaulay (in fact shellable) if and only if G is supersolvable. Finally, it is shown that all the higher order complexes of a finite planar distributive lattice are shellable.

Cite

CITATION STYLE

APA

Björner, A. (1980). Shellable and Cohen-Macaulay partially ordered sets. Transactions of the American Mathematical Society, 260(1), 159–183. https://doi.org/10.1090/s0002-9947-1980-0570784-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free