A conjectural asymptotic formula for multiplicative chaos in number theory

From MaRDI portal
Publication:2145883




Abstract: We investigate a special sequence of random variables A(N) defined by an exponential power series with independent standard complex Gaussians (X(k))kgeq1. 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 mathbbE[|A(N)|]. By constructing an algorithm to calculate A(N) in O(N2logN) 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 pm1 random variables. However, our evidence suggests that the asymptotic constants do not possess a natural product structure.









This page was built for publication: A conjectural asymptotic formula for multiplicative chaos in number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145883)