On lexicographically shellable posets
- 1 January 1983
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 277 (1) , 323-341
- https://doi.org/10.1090/s0002-9947-1983-0690055-6
Abstract
Lexicographically shellable partially ordered sets are studied. A new recursive formulation of CL {\text {CL}} -shellability is introduced and exploited. It is shown that face lattices of convex polytopes, totally semimodular posets, posets of injective and normal words and lattices of bilinear forms are CL {\text {CL}} -shellable. Finally, it is shown that several common operations on graded posets preserve shellability and CL {\text {CL}} -shellability.Keywords
This publication has 9 references indexed in Scilit:
- Bruhat order of Coxeter groups and shellabilityAdvances in Mathematics, 1982
- A partially ordered set and q-Krawtchouk polynomialsJournal of Combinatorial Theory, Series A, 1981
- Shellable and Cohen-Macaulay Partially Ordered SetsTransactions of the American Mathematical Society, 1980
- On Permutation GeometriesJournal of the London Mathematical Society, 1979
- Balanced Cohen-Macaulay ComplexesTransactions of the American Mathematical Society, 1979
- Association schemes and t-designs in regular semilatticesJournal of Combinatorial Theory, Series A, 1976
- Shellings of spheres and polytopesDuke Mathematical Journal, 1974
- Shellable Decompositions of Cells and Spheres.MATHEMATICA SCANDINAVICA, 1971
- Möbius inversion for the Bruhat ordering on a Weyl groupAnnales Scientifiques de lʼÉcole Normale Supérieure, 1971