Inequivalent Representations of Matroids over Prime Fields
arXiv:1101.4683
Abstract
It is proved that for each prime field , there is an integer such that a 4-connected matroid has at most inequivalent representations over . 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 "-coherence". We obtain a variety of other results on inequivalent representations including the following curious one. For a prime power , let denote the set of matroids representable over all fields with at least elements. Then there are infinitely many Mersenne primes if and only if, for each prime power , there is an integer such that a 3-connected member of has at most 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.