Unlabeled equivalence for matroids representable over finite fields

DOI10.1137/1.9781611973037.12MaRDI QIDQ5194743zbMATH OpenOpenAlexFDO

Authors S. R. Kingan

Publication date 17 September 2019

Published in 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.2247

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $rimesn$ matrices $A$ and $A^{\prime }$ 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.

Recommendations

• Matroid representation of projective spaces
• On inequivalent representations of matroids over non-prime fields
• Inequivalent representations of matroids over prime fields
• A computational approach to inequivalence in matroids
• Restrictions as stabilizers

Cited in

(7)

• On the powers of a vectorial matroid -- an equivalence relation.
• Equivalence-free exhaustive generation of matroid representations
• A computational approach to inequivalence in matroids
• scientific article; zbMATH DE number 7352034 (Why is no real title available?)
• Restrictions as stabilizers
• On the number of representations of matroids over finite fields
• Matroid representation of projective spaces

This page was built for publication: Unlabeled equivalence for matroids representable over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5194743)