A short proof of non-GF(5)-representability of matroids
Tutte proved that a matroid is binary if and only if it does not contain a U2,4-minor. This provides a short proof for non-GF(2)-representability in that we can verify that a given minor is isomorphic to U2,4 in just a few rank evaluations. Using excluded-minor characterizations, short proofs can also be given of non-representablity over GF(3) and over GF(4). For GF(5), it is not even known whether the set of excluded minors is finite. Nevertheless, we show here that if a matroid is not representable over GF(5), then this can be verified by a short proof. Here a "short proof" is a proof whose length is bounded by some polynomial in the number of elements of the matroid. In contrast to these positive results, Seymour showed that we require exponentially many rank evaluations to prove GF(2 -representability, and this is in fact the case for any field. © 2003 Elsevier Inc. All rights reserved.
Publication Source (Journal or Book title)
Journal of Combinatorial Theory. Series B
Geelen, J., Oxley, J., Vertigan, D., & Whittle, G. (2004). A short proof of non-GF(5)-representability of matroids. Journal of Combinatorial Theory. Series B, 91 (1), 105-121. https://doi.org/10.1016/j.jctb.2003.11.001