Abstract: A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints in the free erection of the associated simple matroid M. A bound on the number of these new copoints is given in terms of the copoints and colines of M. Also, the points-lines-planes conjecture is shown to be equivalent to a problem concerning the number subgraphs of a certain bipartite graph whose vertices are the points and lines of a geometric lattice.
Recommendations
Cites work
- Constructing the free erection of a geometry
- Erecting Geometries*
- scientific article; zbMATH DE number 3480612 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3552529 (Why is no real title available?)
- scientific article; zbMATH DE number 3563154 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 2021772 (Why is no real title available?)
- scientific article; zbMATH DE number 3422398 (Why is no real title available?)
- Logarithmic concavity for edge lattices of graphs
- On the lines-planes inequality for matroids
- On the number of matroids on a finite set
- On the points-lines-planes conjecture
- Random matroids
Cited in
(3)
This page was built for publication: Concerning the shape of a geometric lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998407)