English

Certifying Non-representability of Matroids Over Prime Fields

Combinatorics 2011-01-26 v1

Abstract

It is proved that, for a prime number pp, showing that an nn-element matroid is not representable over GF(p)GF(p) requires only O(n2)O(n^2) rank evaluations.

Keywords

Cite

@article{arxiv.1101.4691,
  title  = {Certifying Non-representability of Matroids Over Prime Fields},
  author = {Jim Geelen and Geoff Whittle},
  journal= {arXiv preprint arXiv:1101.4691},
  year   = {2011}
}
R2 v1 2026-06-21T17:16:26.580Z