Inequalities for the h- and flag h-vectors of geometric lattices
classification
🧮 math.CO
keywords
geometricflagh-vectorordercomplexinequalitieslatticelattices
read the original abstract
We prove that the order complex of a geometric lattice has a convex ear decomposition. As a consequence, if D(L) is the order complex of a rank (r+1) geometric lattice L, then for all i \leq r/2 the h-vector of D(L) satisfies h(i-1) \leq h(i) and h(i) \leq h(r-i). We also obtain several inequalities for the flag h-vector of D(L) by analyzing the weak Bruhat order of the symmetric group. As an application, we obtain a zonotopal cd-analogue of the Dowling-Wilson characterization of geometric lattices which minimize Whitney numbers of the second kind. In addition, we are able to give a combinatorial flag h-vector proof of h(i-1) \leq h(i) when i \leq (2/7)(r + 5/2).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.