On geometric semilattices

We define geometric semilattices, a generalization of geometric lattices. The poset of independent sets of a matroid is another example. We prove several axiomatic and constructive characterizations, for example: geometric semilattices are those semilattices obtained by removing a principal filter from a geometric lattice. We also show that all geometric semilattices are shellable, unifying and extending several previous results.

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

[2]  T. Zaslavsky The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements , 1981 .

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

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

[5]  Richard P. Stanley,et al.  An Introduction to Cohen-Macaulay Partially Ordered Sets , 1982 .

[6]  K. Vogtmann Spherical posets and homology stability for 0n,n , 1981 .

[7]  Tom Brylawski,et al.  Modular constructions for combinatorial geometries , 1975 .

[8]  T. Zaslavsky Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[9]  H. Crapo A higher invariant for matroids , 1967 .

[10]  Michelle L. Wachs,et al.  On lexicographically shellable posets , 1983 .

[11]  G. Rota,et al.  On The Foundations of Combinatorial Theory: Combinatorial Geometries , 1970 .

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

[13]  George Lusztig,et al.  The discrete series of GLn over a finite field , 1974 .

[14]  Anders Björner,et al.  Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings , 1984 .

[15]  J. Scott Provan,et al.  Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra , 1980, Math. Oper. Res..