Indexed metadata

Statistics of entries of matrices from the general linear group over a finite field

Ofir Gorodetsky

Source record

Source: arXiv

Published: Oct 21, 2026

arXiv: 2610.29305

Open original source ↗

Source abstract

Let GLn(Fq)\mathrm{GL}_n(\mathbb{F}_q) be the group of n×nn\times n invertible matrices over a finite field Fq\mathbb{F}_q. How many matrices in GLn(Fq)\mathrm{GL}_n(\mathbb{F}_q) are there with a subset of their entries prescribed? Motivated by the random matrix theory of classical compact groups, we address this question and various variants, with a focus on asymptotic results that are valid as nn tends to infinity. Our methods are Fourier-analytic, with the main input being an exponential sum over GLn(Fq)\mathrm{GL}_n(\mathbb{F}_q), evaluated in 1955 by Hodges via elementary methods. Our results turn out to be related to investigations carried out in other fields, including coding theory, universality for pp-adic matrices and algebraic combinatorics.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.