Asymptotic Uniformity of Permanents of Random Matrices over Finite Fields of Odd Characteristic

Abstract

Let $q$ be an odd prime power, and let $A_n=(a_{ij})\in\mathbb F_q^{n\times n}$ be a random matrix whose entries are independent and uniformly distributed on $\mathbb F_q$. The permanent of $A_n$ is defined by $\operatorname{per}(A_n)=\sum_{σ\in S_n}\prod_{i=1}^n a_{i,σ(i)}$, where $S_n$ denotes the symmetric group on $[n]$. Ghasemi, Gross, and Kopparty conjectured the zero-mass asymptotic $\Pr[\operatorname{per}(A_n)=0]=1/q+o(1)$ for every fixed odd prime power $q$, and Hunter, Kwan, and Sauermann subsequently stated its equivalent full-distribution formulation: for every fixed $q$ and every $x\in\mathbb F_q$, \[ \lim_{n\to\infty}\Pr[\operatorname{per}(A_n)=x]=\frac1q. \] In this paper, we prove this conjecture. More precisely, we prove that there is an absolute constant $C>0$ such that \[\frac12\sum_{x\in\mathbb F_q}\left|\Pr[\operatorname{per}(A_n)=x]-\frac1q\right|\le C\frac{\log n}{n}\] for every odd prime power $q$ and every $n\ge 7$. The estimate is uniform in $q$, so the conclusion remains valid for every sequence $q=q(n)$ of odd prime powers.

Disclosure

“Declaration on the Use of AI During the development of the proof in Section 3, the authors used generative AI tools as research aids. The conditional-probability formulation leading to the map TG , the recognition that an approach using only one additional row would result in a circular argument, and the resulting introduction of a second row and”

PDF page 12

Classification

Substantial mathematical content or result generation

Multiplier

10

Verified

2026-08-23T19:10:52.458765Z

Structural counts