Almost sure bounds for weighted sums of Rademacher random multiplicative functions
Abstract
We prove that when f is a Rademacher random multiplicative function for any ε>0, then Σn ≤slant xf(n)n ((x))3/4+ε for almost all f. We also show that there exist arbitrarily large values of x such that Σn ≤slant xf(n)n ((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 Σn ≤slant x \\ P(n) > xf(n)n ((x))1/4+ε.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.