Abstract

The Whitney numbers of a finite geometric lattice L of rank r are the numbers ${W_k}$ of elements of rank k and the coefficients ${w_k}$ of the characteristic polynomial of L, for $0 \leq k \leq r$. We establish the following lower bounds for the ${W_k}$ and the absolute values $w_k^ + = {( - 1)^k}{w_k}$ and describe the lattices for which equality holds (nontrivially) in each case: \[ {W_k} \geq \left ( {\begin {array}{*{20}{c}} r \hfill & - \hfill & 2 \hfill \\ k \hfill & - \hfill & 1 \hfill \\ \end {array} } \right )(n - r) + \left ( {\begin {array}{*{20}{c}} r \hfill \\ k \hfill \\ \end {array} } \right ),\quad w_k^ + \geq \left ( {\begin {array}{*{20}{c}} r \hfill & - \hfill & 1 \hfill \\ k \hfill & - \hfill & 1 \hfill \\ \end {array} } \right )(n - r) + \left ( {\begin {array}{*{20}{c}} r \hfill \\ k \hfill \\ \end {array} } \right ),\] where $n = {W_1}$ is the number of points of L.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.