Moments of random multiplicative functions with polynomial coefficients
For a Steinhaus random multiplicative function f and a real polynomial g of degree d, one studies the moments of the normalized sum S_N = N^{-1/2} sum_{n<=N} f(n) e(g(n)). The question is how the Diophantine properties of the polynomial coefficients control the moment behaviour.
The 2s-th moment is reduced via orthogonality to an exponential sum over the multiplicative solution set V of n_1...n_s = m_1...m_s. An inclusion-exclusion decomposition of V using large-gcd sets is combined with divisor bounds and quantitative Green-Tao equidistribution/recurrence results to isolate main and error terms. The main theorem is proved by induction on s. Lean 4 code is supplied for verification of the proofs.
A quantitative dichotomy is established: for each s>=2, either E|S_N|^{2s} is close to the Gaussian moment s!, or the coefficients of g are well-approximated by rationals with small denominator. Under a Diophantine condition, S_N converges in law to a standard complex normal distribution.
