arXiv Analytics

Sign in

arXiv:1202.2247 [math.CO]AbstractReferencesReviewsResources

Unlabeled equivalence for matroids representable over finite fields

S. R. Kingan

Published 2012-02-10Version 1

We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it 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.

Related articles: Most relevant | Search more
arXiv:0801.0728 [math.CO] (Published 2008-01-04, updated 2008-03-31)
Generalized incidence theorems, homogeneous forms, and sum-product estimates in finite fields
arXiv:1509.09158 [math.CO] (Published 2015-09-30)
Necessary conditions for the existence of 3-designs over finite fields with nontrivial automorphism groups
arXiv:1106.1148 [math.CO] (Published 2011-05-31)
An improved sum-product estimate over finite fields