This paper defines the $q$-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a $q$-matroid, and why they are (not) cryptomorphic. Also, we explain the motivation for studying $q$-matroids by showing that a rank metric code gives a $q$-matroid.
@article{10_37236_6569,
author = {Relinde Jurrius and Ruud Pellikaan},
title = {Defining the \(q\)-analogue of a matroid},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {3},
doi = {10.37236/6569},
zbl = {1393.05071},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6569/}
}
TY - JOUR
AU - Relinde Jurrius
AU - Ruud Pellikaan
TI - Defining the \(q\)-analogue of a matroid
JO - The electronic journal of combinatorics
PY - 2018
VL - 25
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/6569/
DO - 10.37236/6569
ID - 10_37236_6569
ER -
%0 Journal Article
%A Relinde Jurrius
%A Ruud Pellikaan
%T Defining the \(q\)-analogue of a matroid
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/6569/
%R 10.37236/6569
%F 10_37236_6569
Relinde Jurrius; Ruud Pellikaan. Defining the \(q\)-analogue of a matroid. The electronic journal of combinatorics, Tome 25 (2018) no. 3. doi: 10.37236/6569