Counting q-Matroids

$q$-Matroids, a $q$-analogue of classical matroids have attracted a lot of attention over the last decade, yet their enumeration remains largely unexplored. In this paper, we study the number of $q$-matroids, paving and sparse-paving $q$-matroids defined on a fixed ground space and with prescribed rank. We derive new lower bounds using constructions from constant-dimension codes and improve existing estimates. On the upper bound side, we develop two approaches: a combinatorial method based on controlling the number of dependent hyperplanes for paving $q$-matroids, and an entropy-based counting argument applicable to classes of $q$-matroids closed under contraction. These techniques yield explicit upper bounds on the logarithmic number of $q$-matroids with fixed rank and ground space. Finally, we analyze the asymptotic behavior of these bounds, and identify gaps between lower and upper estimates, leading to conjectures on the true asymptotic growth.