Unlabeled equivalence for matroids representable over finite fields
Abstract
We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two r× n matrices A and A' representing the same matroid M over a field F are geometrically equivalent representations of M if one can be obtained from the other by elementary row operations, column scaling, and column permutations. Using geometric equivalence, we give a method for exhaustively generating non-isomorphic matroids representable over a finite field GF(q), where q is a power of a prime.
0