alphaFeedback

WorksMathematics

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

Publication details
License
arXiv nonexclusive license
Status
Published
AI contributions
  • a generative AI tool
View details
Abstract · v1

Let qq be an odd prime power, and let An=(aij)∈Fqn×nA_n=(a_{ij})\in\mathbb F_q^{n\times n} be a random matrix whose entries are independent and uniformly distributed on Fq\mathbb F_q. The permanent of AnA_n is defined by per⁡(An)=∑σ∈Sn∏i=1nai,σ(i)\operatorname{per}(A_n)=\sum_{σ\in S_n}\prod_{i=1}^n a_{i,σ(i)}, where SnS_n denotes the symmetric group on [n][n]. Ghasemi, Gross, and Kopparty conjectured the zero-mass asymptotic Pr⁡[per⁡(An)=0]=1/q+o(1)\Pr[\operatorname{per}(A_n)=0]=1/q+o(1) for every fixed odd prime power qq, and Hunter, Kwan, and Sauermann subsequently stated its equivalent full-distribution formulation: for every fixed qq and every x∈Fqx\in\mathbb F_q, lim⁡n→∞Pr⁡[per⁡(An)=x]=1q. \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>0C>0 such that 12∑x∈Fq∣Pr⁡[per⁡(An)=x]−1q∣≤Clog⁡nn\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 qq and every n≥7n\ge 7. The estimate is uniform in qq, so the conclusion remains valid for every sequence q=q(n)q=q(n) of odd prime powers.

Review conversation

Reviews are not available for this work yet.