The many-rank matrix-sum equidistribution conjecture

From papers

Let Matqn×n\operatorname{Mat}^{n\times n}_q be the additive group of n×nn\times n matrices over Fq\mathbb F_q. For integers r1,,rk,tr_1,\ldots,r_k,t with 0ri,tn0\le r_i,t\le n, let Nqn×n(r1,,rk;t)\mathcal N^{n\times n}_q(r_1,\ldots,r_k;t) denote the number of kk-tuples of matrices of respective ranks r1,,rkr_1,\ldots,r_k whose sum is a fixed matrix of rank tt, and let Rqn×n(r)\mathcal R^{n\times n}_q(r) denote the number of matrices of rank rr. Many-rank matrix-sum equidistribution conjecture. For every ϵ>0\epsilon>0 there exists K(ϵ)K(\epsilon) such that, if kK(ϵ)k\ge K(\epsilon) and ϵnr1,,rkn\epsilon n\le r_1,\ldots,r_k\le n, then

Nqn×n(r1,,rk;t)=O(1)Rqn×n(r1)Rqn×n(rk)qn2.\mathcal N^{n\times n}_q(r_1,\ldots,r_k;t)=\operatorname{O}(1)\,\frac{\mathcal R^{n\times n}_q(r_1)\cdots\mathcal R^{n\times n}_q(r_k)}{q^{n^2}}.

The source introduces this as the second of two conjectural generalizations of results in the paper; no resolution status is supplied.

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

Nick Gill, Noam Lifshitz, László Pyber and Endre Szabó, “Initiating the proof of the Liebeck–Nikolov–Shalev conjecture”, arXiv:2408.07800 (2024).

Solutions 0

No solutions have been posted yet.