Asymptotic counting conjecture for q-matroids of rank r on a 2r-dimensional space

From papers

Let sq(r,2r)s_q(r,2r), pq(r,2r)p_q(r,2r), and mq(r,2r)m_q(r,2r) denote respectively the numbers of sparse paving, paving, and all qq-matroids of rank rr on a 2r2r-dimensional space over the finite field with qq elements, where qq is a prime power. For nonnegative functions, write f(t)g(t)f(t)\approx g(t) as tt\to\infty when

limtf(t)g(t)R>0.\lim_{t\to\infty}\frac{f(t)}{g(t)}\in\mathbb{R}_{>0}.

Asymptotic counting conjecture. For each prime power qq, we have

qr(r1)log(sq(r,2r))log(pq(r,2r))log(mq(r,2r))q^{r(r-1)}\approx\log(s_q(r,2r))\approx\log(p_q(r,2r))\approx\log(m_q(r,2r))

as rr\to\infty. This would extend the corresponding asymptotic equality for classical matroids to qq-matroids and would show that sparse paving, paving, and all qq-matroids have the same logarithmic asymptotic order in the middle-rank regime.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Benjamin Jany, Relinde Jurrius and Rudi Pendavingh, “Counting q-Matroids”, arXiv:2606.20348 (2026).

Solutions 0

No solutions have been posted yet.