Partial sums of random multiplicative functions with supercritical divisor twists
Abstract
Let f be a Steinhaus random multiplicative function, and for α∈ R, let dα denote the α-divisor function. For α ∈ (1,2) we establish that E\|1xΣn≤ x dα(n)f(n)|2q\ ( x)2q(α-1)( x)3α q/2(1-α q)+1 uniformly for q∈ [0,1/α] and all large x. This matches predictions from the theory of supercritical Gaussian multiplicative chaos, and provides an analogue of a seminal result of Harper corresponding to the critical (α=1) case. Our approach is based on studying the measure of level sets of an Euler product associated with f, and yields a short proof of Harper's upper bound at α=1 (implying Helson's conjecture at q=1/2). As an additional application, we obtain a conjecturally sharp bound for the pseudomoments of the Riemann zeta function in a certain parameter range, showing that T∞1T∫T2T |Σn≤ xdα(n)n1/2+it|2q dt ( x)2q(α-1)( x)3α q/2, for α∈ (1,2) and small q>0. This answers a question of Gerspach.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.