Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 12 min ago
PreprintarXiv licencearXiv

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

Abstract

Let GLn(𝔽q) be the group of n× n invertible matrices over a finite field 𝔽q. How many matrices in GLn(𝔽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 n tends to infinity. Our methods are Fourier-analytic, with the main input being an exponential sum over GLn(𝔽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 p-adic matrices and algebraic combinatorics.

Related

  1. Spectral Universality for Matrices with Non-Linear Correlated Entries
    Marwa Banna, Issa-Mbenard Dabo, Florence Merlevède
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  2. Random p-adic matrices with fixed zero entries and the Cohen–Lenstra distribution
    Dong Yeap Kang, Jungin Lee, Myungjun Yu
    Selecta MathematicaPeer-reviewedLicence not statedFull text11 citedAlgebra & number theoryOpenAlex
  3. The Karcher Mean on 2× 2 Triangular Matrices with Positive Diagonal Entries
    Huajun Huang
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryAnalysis & PDEsarXiv
  4. Möbius functions for pseudo-Levi subgroups in finite general linear and symplectic groups
    Aritra Kundu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Mesoscopic eigenvalue statistics for correlated random matrices
    László Erdős, Jaehun Lee
    arXivPreprintarXiv licenceFull textProbabilityarXiv
BibTeX
@misc{gorodetsky2026statistics,
  title = {{Statistics of entries of matrices from the general linear group over a finite field}},
  author = {Ofir Gorodetsky},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29305},
  eprint = {2610.29305},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29305},
}
RIS
TY  - UNPB
TI  - Statistics of entries of matrices from the general linear group over a finite field
AU  - Ofir Gorodetsky
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.29305
UR  - https://arxiv.org/abs/2610.29305
AB  - Let GL_n(𝔽_q) be the group of n× n invertible matrices over a finite field 𝔽_q. How many matrices in GL_n(𝔽_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 n tends to infinity. Our methods are Fourier-analytic, with the main input being an exponential sum over GL_n(𝔽_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 p-adic matrices and algebraic combinatorics.
ER  -