Matroid flat counts are not unimodal
Abstract
We give counterexamples to Rota's 1970 conjecture that the sequence counting flats of varying rank in a matroid is unimodal. More specifically, inspired by Larson's recent disproof of the stronger log-concavity conjecture of Mason, we explain a mechanism which turns failures of log-concavity for flats into failures of unimodality under suitable conditions.
Disclosure
“MODAL 7 How the counterexamples were found. The starting point of this paper was an attempt to study the convexity of (Wi−1 )i , which is weaker than log-concavity but stronger than unimodality. We used ChatGPT 5.6 Pro to search for a counterex- ample to this weaker property. Based on a suggestion of the authors, ChatGPT 5.6 Pro returned a non-convex example built using a q-lift. We quickly realized this construction could in fact be adapted and”
PDF page 7
- Classification
- Substantial mathematical content or result generation
- Multiplier
- 10
- Verified
Structural counts
Count notes
- arXiv source was unavailable; PDF-text fallbacks were used.
- Appendix pages include the first PDF page with an explicit Appendix heading through the final page.