A Poset which is Shellable but not Lexicographically Shellable

Planar Lattices are Lexicographically Shellable

The special properties of planar posets have been studied, particularly in the 1970's by I. Rival and others. More recently, the connection between posets, their corresponding polynomial rings and corresponding simplicial complexes has been studied by R. Stanley and others. This paper, using work of A. Bjorner, provides a connection between the two bodies of work, by characterizing when planar...

The Complement of a D-Tree is Pure Shellable

Criterions for Shellable Multicomplexes

After [4] the shellability of multicomplexes Γ is given in terms of some special faces of Γ called facets. Here we give a criterion for the shellability in terms of maximal facets. Multigraded pretty clean filtration is the algebraic counterpart of a shellable multicomplex. We give also a criterion for the existence of a multigraded pretty clean filtration.

Shellable complexes from multicomplexes

Suppose a group G acts properly on a simplicial complex Γ . Let l be the number of G-invariant vertices, and p1,p2, . . . , pm be the sizes of the G-orbits having size greater than 1. Then Γ must be a subcomplex of Λ = Δl−1 ∗ ∂Δp1−1 ∗ · · · ∗ ∂Δpm−1. A result of Novik gives necessary conditions on the face numbers of Cohen–Macaulay subcomplexes of Λ. We show that these conditions are also suffi...

A Note about Shellable Planar Posets

We will show that shellability, Cohen-Macaulayness and vertexde composability of a graded, planar poset P are all equivalent with the fact that P has the maximal possible number of edges. Also, for a such poset we will find an R−labelling with {1, 2} as the set of labels. Using this, we will obtain all essential linear inequalities for the flag h−vectors of shellable planar posets from [1]. AMS...