A sharp almost sure upper bound for partial sums of random multiplicative functions
arXiv:2607.29429
Abstract
We prove that, for either a Steinhaus random multiplicative function or a Rademacher random multiplicative function , and every , almost surely . Together with Harper's almost sure lower bound, this determines the sharp logarithmic exponent in both models. This settles Harper's conjecture on the large fluctuations of random multiplicative functions.
arXiv commentv3:AI declaration included