English

A generalisation of uniform matroids

Combinatorics 2021-02-24 v1

Abstract

A matroid is uniform if and only if it has no minor isomorphic to U1,1U0,1U_{1,1}\oplus U_{0,1} and is paving if and only if it has no minor isomorphic to U2,2U0,1U_{2,2}\oplus U_{0,1}. This paper considers, more generally, when a matroid MM has no Uk,kU0,U_{k,k}\oplus U_{0,\ell}-minor for a fixed pair of positive integers (k,)(k,\ell). Calling such a matroid (k,)(k,\ell)-uniform, it is shown that this is equivalent to the condition that every rank-(r(M)k)(r(M)-k) flat of MM has nullity less than \ell. Generalising a result of Rajpal, we prove that for any pair (k,)(k,\ell) of positive integers and prime power qq, only finitely many simple cosimple GF(q)GF(q)-representable matroids are \kl-uniform. Consequently, if Rota's Conjecture holds, then for every prime power qq, there exists a pair (kq,q)(k_q,\ell_q) of positive integers such that every excluded minor of GF(q)GF(q)-representability is (kq,q)(k_q,\ell_q)-uniform. We also determine all binary (2,2)(2,2)-uniform matroids and show the maximally 33-connected members to be Z5\t,AG(4,2),AG(4,2)Z_5\backslash t, AG(4,2), AG(4,2)^* and a particular self-dual matroid P10P_{10}. Combined with results of Acketa and Rajpal, this completes the list of binary (k,)(k,\ell)-uniform matroids for which k+4k+\ell\leq 4.

Keywords

Cite

@article{arxiv.2102.11422,
  title  = {A generalisation of uniform matroids},
  author = {George Drummond},
  journal= {arXiv preprint arXiv:2102.11422},
  year   = {2021}
}

Comments

10 pages, 8 figures

R2 v1 2026-06-23T23:25:28.000Z