English

Inequivalent Representations of Matroids over Prime Fields

Combinatorics 2011-01-26 v1

Abstract

It is proved that for each prime field GF(p)GF(p), there is an integer f(p)f(p) such that a 4-connected matroid has at most f(p)f(p) inequivalent representations over GF(p)GF(p). We also prove a stronger theorem that obtains the same conclusion for matroids satisfying a connectivity condition, intermediate between 3-connectivity and 4-connectivity that we term "kk-coherence". We obtain a variety of other results on inequivalent representations including the following curious one. For a prime power qq, let R(q){\mathcal R}(q) denote the set of matroids representable over all fields with at least qq elements. Then there are infinitely many Mersenne primes if and only if, for each prime power qq, there is an integer mqm_q such that a 3-connected member of R(q){\mathcal R}(q) has at most mqm_q inequivalent GF(7)-representations. The theorems on inequivalent representations of matroids are consequences of structural results that do not rely on representability. The bulk of this paper is devoted to proving such results.

Keywords

Cite

@article{arxiv.1101.4683,
  title  = {Inequivalent Representations of Matroids over Prime Fields},
  author = {Jim Geelen and Geoff Whittle},
  journal= {arXiv preprint arXiv:1101.4683},
  year   = {2011}
}
R2 v1 2026-06-21T17:16:25.762Z