Almost sure bounds for weighted sums of Rademacher random multiplicative functions

2025/01/19 by Atherfold, Christopher · 2 citations
#FOS: Mathematics #Number Theory (math.NT) #Probability (math.PR)

paper · doi:10.48550/arxiv.2501.11076

Abstract

We prove that when f is a Rademacher random multiplicative function for any ε>0, then ∑_{n \leqslant x}(f(n))/(√(n)) ≪ (loglog(x))^61/80+ε for almost all f. We also show that there exist arbitrarily large values of x such that ∑_{n \leqslant x}(f(n))/(√(n)) ≫ (loglog(x))^-1/2. This is different to what is found in the Steinhaus case, this time with the size of the Rademacher Euler product making the multiplicative chaos contribution the dominant one. We also find a sharper upper bound when we restrict to integers with a prime factor greater than √(x), proving that ∑_\substackn \leqslant x P(n) > √(x)(f(n))/(√(n)) ≪ (loglog(x))^21/80+ε.

Cited by

• Worst-case Nonparametric Bounds for the Student T-statistic
• A sharp almost sure upper bound for partial sums of random multiplicative functions

Related

• Almost sure large fluctuations of random multiplicative functions
• Almost sure upper bound for random multiplicative functions
• Bounds for exponential sums with random multiplicative coefficients
• Almost sure bounds for a weighted Steinhaus random multiplicative function
• An almost sure upper bound for random multiplicative functions on integers with a large prime factor