A sharp almost sure upper bound for partial sums of random multiplicative functions

arXiv:2607.29429 · math.NT, math.PR · Submitted 2026-07-31 · Read on arXiv

math.NT, math.PR

Submitted: 2026-07-31

Updated: 2026-10-26

Comments: v3:AI declaration included

Code: https://github.com/saasom/Erdos520

License: http://creativecommons.org/licenses/by/4.0/

The gist: We prove that, for either a Steinhaus random multiplicative function or a Rademacher random multiplicative function f, and every epsilon>0…

Terminology

Abstract

We prove that, for either a Steinhaus random multiplicative function or a Rademacher random multiplicative function f, and every epsilon>0, almost surely sum n at most xf(n) much less than epsilon,f sqrt x (x) 1/4+ epsilon. 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.

Sources

Related papers