论文信息 - On lexicographically shellable posets

On lexicographically shellable posets

Lexicographically shellable partially ordered sets are studied. A new recursive formulation of 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-shellable. Finally, it is shown that several common operations on graded posets preserve shellability and CL-shellability.

Michelle L. Wachs | Anders Björner | A. Björner | M. Wachs

[1] A. Björner. Shellable and Cohen-Macaulay partially ordered sets , 1980 .

[2] Dennis Stanton,et al. A Partially Ordered Set and q-Krawtchouk Polynomials , 1981, J. Comb. Theory, Ser. A.

[3] Philippe Delsarte,et al. Association Schemes and t-Designs in Regular Semilattices , 1976, J. Comb. Theory A.

[4] Michelle L. Wachs,et al. Bruhat Order of Coxeter Groups and Shellability , 1982 .

[5] P. Mani,et al. Shellable Decompositions of Cells and Spheres. , 1971 .

[6] Daya-Nand Verma,et al. Möbius inversion for the Bruhat ordering on a Weyl group , 1971 .

[7] Peter J. Cameron,et al. ON PERMUTATION GEOMETRIES , 1979 .

[8] Richard P. Stanley,et al. Balanced Cohen-Macaulay complexes , 1979 .

[9] V. Klee,et al. Shellings of Spheres and Polytopes. , 1974 .