Papers › A conjectural asymptotic formula for multiplicative chaos in number theory
A conjectural asymptotic formula for multiplicative chaos in number theory
Daksh Aggarwal, Unique Subedi, William Verreault, Asif Zaman, Chenghui Zheng
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We investigate a special sequence of random variables A(N) defined by an exponential power series with independent standard complex Gaussians (X(k))_(k ≥1). Introduced by Hughes, Keating, and O'Connell in the study of random matrix theory, this sequence relates to Gaussian multiplicative chaos (in particular "holomorphic multiplicative chaos'' per Najnudel, Paquette, and Simm) and random multiplicative functions. Soundararajan and Zaman recently determined the order of 𝔼[|A(N)|]. By constructing an algorithm to calculate A(N) in O(N² logN) steps, we produce computational evidence that their result can likely be strengthened to an asymptotic result with a numerical estimate for the asymptotic constant. We also obtain similar conclusions when A(N) is defined using standard real Gaussians or uniform ±1 random variables. However, our evidence suggests that the asymptotic constants do not possess a natural product structure.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections