A sharp almost sure upper bound for partial sums of random multiplicative functions
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
- Almost sure bounds for weighted sums of Rademacher random multiplicative functions
- On the limiting distribution of sums of random multiplicative functions
- The distribution of partial sums of random multiplicative functions with a large prime factor
- The typical size of character and zeta sums is $o(\sqrt{x})$
- Moments of random multiplicative functions, III: A short review
- Distribution of random multiplicative functions in short intervals, with proper normalization
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Completing the classification of torsion over sextic fields for elliptic curves defined over Q
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models