betaFeedback

WorksMathematics

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

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.

Paper details

vlnc:W_nyrje8sg
Version
v2 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

LLM

View statement
Looking for related papers…