Linear inequalities for rank 3 geometric lattices (Q1880212)

Let \(L\) be a geometric lattice of rank \(n\). The Whitney numbers (of the second kind) are the numbers \(\{a_0, a_1, \dots, a_n\}\), where \(a_k\) denotes the number of elements in \(L\) of rank \(k\) (\(a_0 = 1\)). The flag Whitney numbers are defined as the number of chains of \(L\) which have specified ranks. A collection of inequalities is presented which imply all the linear inequalities satisfied by the flag Whitney numbers of rank 3 geometric lattices. Moreover, the smallest closed convex set containing the flag Whitney numbers of rank 3 geometric lattices is described, as well as the smallest closed convex set containing the flag Whitney numbers of those lattices corresponding to oriented matroids. At the end of the paper the extension of the results to higher ranks is briefly discussed.