Conjectural asymptotic formula for the first moment of multiplicative chaos coefficients

From papers

Let (A(N))N0(A(N))_{N \geqslant 0} be defined by the formal power series associated with a sequence (X(k))k1(X(k))_{k \geqslant 1} of independent standard complex Gaussians. First-moment asymptotic conjecture. There exists a constant C>0C > 0 such that

E[A(N)]C(logN)1/4as N.\mathbb{E}[|A(N)|] \sim \frac{C}{(\log N)^{1/4}} \qquad \text{as } N \to \infty.

The existence of a limiting distribution for A(N)A(N) is unknown, and this conjecture gives the predicted order and leading constant for its first absolute moment. The estimate is consistent with known upper and lower bounds of order (logN)1/4(\log N)^{-1/4}.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Daksh Aggarwal, Unique Subedi, William Verreault, Asif Zaman and Chenghui Zheng, “A conjectural asymptotic formula for multiplicative chaos in number theory”, arXiv:2108.11367 (2021).

Solutions 0

No solutions have been posted yet.