Defining the q-analogue of a matroid
Combinatorics
2020-05-25 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.1610.09250,
title = {Defining the q-analogue of a matroid},
author = {Relinde Jurrius and Ruud Pellikaan},
journal= {arXiv preprint arXiv:1610.09250},
year = {2020}
}
Comments
35 pages