Most \(q\)-matroids are not representable
Combinatorial Theory · 20.08.2026 · 6 (2)
DOI: 10.5070/c6.68695 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorial Theory, online erschienen am 20.08.2026. Verfasst von Sebastian Degen und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A \(q\)-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These \(q\)-matroids are motivated by coding theory as the representable \(q\)-matroids are the ones that stem from rank-metric codes. In this note, we establish a \(q\)-analogue of Nelson's theorem in matroid theory by proving that asymptotically almost all \(q\)-matroids are not representable. This answers a question about representable \(q\)-matroids by Jurrius and Pellikaan strongly in the negative. Mathematics Subject Classifications: 05B35, 05A30 Keywords: \(q\)-matroids, representability, rank-metric codes
Zitieren
APA
Degen, S., & Kühne, L. (2026). Most \(q\)-matroids are not representable. Combinatorial Theory, 6(2). https://doi.org/10.5070/c6.68695
Vancouver
Degen S, Kühne L. Most \(q\)-matroids are not representable. Combinatorial Theory. 2026;6(2). doi:10.5070/c6.68695
BibTeX
@article{Degen2026,
author = {Degen, Sebastian and Kühne, Lukas},
title = {Most \(q\)-matroids are not representable},
journal = {Combinatorial Theory},
year = {2026},
volume = {6},
number = {2},
doi = {10.5070/c6.68695}
}
EUVIMED