Doubly exponentially many Ingleton matroids
Peter Nelson, Jorn van der Pol

TL;DR
This paper proves that the number of Ingleton matroids on a ground set of size n grows doubly exponentially with n, indicating that most Ingleton matroids are not representable.
Contribution
It establishes the asymptotic count of Ingleton matroids, showing their abundance and the predominance of non-representable cases.
Findings
Number of Ingleton matroids on [n] is doubly exponential in n.
Almost all Ingleton matroids are non-representable.
Ingleton's inequality characterizes a large class of matroids.
Abstract
A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set is doubly exponential in ; it follows that almost all Ingleton matroids are non-representable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
