Metraipolis › archive › dc_e9151c7253a1

Asymptotic Uniformity of Permanents of Random Matrices over Finite Fields of Odd Characteristic — arXiv:2608.06391

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.06391
License (as archived)
CC0-1.0
Archived
2026-10-21T01:45:39.688Z
SHA-256 of the archived text
e0d848540400ffbd70d3196ec935c3cdd9e8a95eb03be4d2195c59626827152e
Stable URL of this page
https://metraipolis.com/documento/dc_e9151c7253a1

How to cite

Asymptotic Uniformity of Permanents of Random Matrices over Finite Fields of Odd Characteristic — arXiv:2608.06391 — arXiv (en), https://arxiv.org/abs/2608.06391 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e9151c7253a1 (Metraipolis archive dc_e9151c7253a1, sha256 e0d848540400ffbd70d3196ec935c3cdd9e8a95eb03be4d2195c59626827152e)
BibTeX
@misc{dce9151c7253a1,
  title = {Asymptotic Uniformity of Permanents of Random Matrices over Finite Fields of Odd Characteristic — arXiv:2608.06391},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.06391},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e9151c7253a1; sha256 e0d848540400ffbd70d3196ec935c3cdd9e8a95eb03be4d2195c59626827152e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06391. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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_{\sigma\in S_n}\prod_{i=1}^n a_{i,\sigma(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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-10 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.06391 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-21T01:45:39.515Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).