A generalisation of uniform matroids
George Drummond

TL;DR
This paper generalizes the concept of uniform and paving matroids by introducing (k, l)-uniform matroids, characterizes their properties, and explores their finiteness and classification in relation to representability over finite fields.
Contribution
It defines (k, l)-uniform matroids, proves their finiteness in GF(q)-representable cases, and classifies binary (k, l)-uniform matroids for small parameters.
Findings
(k, l)-uniformity relates to flat nullity conditions
Finiteness of GF(q)-representable (k, l)-uniform matroids for fixed (k, l)
Complete classification of binary (k, l)-uniform matroids for k+l ≤ 4
Abstract
A matroid is uniform if and only if it has no minor isomorphic to and is paving if and only if it has no minor isomorphic to . This paper considers, more generally, when a matroid has no -minor for a fixed pair of positive integers . Calling such a matroid -uniform, it is shown that this is equivalent to the condition that every rank- flat of has nullity less than . Generalising a result of Rajpal, we prove that for any pair of positive integers and prime power , only finitely many simple cosimple -representable matroids are \kl-uniform. Consequently, if Rota's Conjecture holds, then for every prime power , there exists a pair of positive integers such that every excluded minor of -representability is -uniform.…
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.
