A Lower Bound Theorem for strongly regular CW spheres with up to $2d+1$ vertices

TL;DR

This paper extends a conjecture on face counts of polytopes with up to 2d vertices to broader classes like lattices and CW complexes, providing lower bounds and characterizations of equality cases.

Contribution

It generalizes Grünbaum's conjecture to lattices with the diamond property and strongly regular CW complexes, establishing new lower bounds and characterizations.

Findings

Lattices with the diamond property have at least _k(d+s,d) elements of rank k+1.

Characterization of equality cases for face lattices of certain CW complexes.

Sharp lower bounds on the number of k-faces for complexes with 2d+1 vertices.

Abstract

In 1967, Gr\"unmbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. This conjecture along with the characterization of equality cases was recently proved by the author. In this paper, several extensions of this result are established. Specifically, it is proved that lattices with the diamond property (for example, abstract polytopes) and $d+s\leq 2d$ atoms have at least $\phi_k(d+s,d)$ elements of rank $k+1$. Furthermore, in the case of face lattices of strongly regular CW complexes representing normal pseudomanifolds with up to $2d$ vertices, a characterization of equality cases is given. Finally, sharp lower bounds on the number of $k$-faces of strongly regular CW complexes representing normal pseudomanifolds with $2d+1$ vertices are obtained. These bounds are given by the face numbers of certain polytopes with $2d+1$ vertices.