Unlabeled equivalence for matroids representable over finite fields
Combinatorics
2015-09-16 v1
Abstract
We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two matrices and representing the same matroid over a field are {\it geometrically equivalent representations} of 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 , where is a power of a prime.
Cite
@article{arxiv.1202.2247,
title = {Unlabeled equivalence for matroids representable over finite fields},
author = {S. R. Kingan},
journal= {arXiv preprint arXiv:1202.2247},
year = {2015}
}