Lower bounds for low moments of character sums, I: Short sums with general multiplicative weights
Abstract
We establish sharp lower bounds for the Dirichlet character moments 1r-1 Σχ\; mod \; r |Σn ≤ x χ(n)|2q, where r is a large prime, 1 ≤ x ≤ r0.499, and 0 ≤ q ≤ 1 is real. These match the better than squareroot cancellation upper bounds obtained in previous work of the author. We prove the same sharp lower bounds for the moments 1T ∫0T |Σn ≤ x nit|2q dt of zeta sums, and more generally for moments of character sums Σn ≤ x h(n) χ(n) with suitably bounded multiplicative twist h(n). The proofs are based on a comparison of the sizes of 1r-1 Σχ\; mod \; r (Σn ≤ x χ(n)) I(χ), 1r-1 Σχ\; mod \; r |I(χ)|2 and 1r-1 Σχ\; mod \; r |I(χ)|4, where I(χ) is a certain ``barrier adjusted'' Perron integral inspired by the analogous results for random multiplicative functions. In a companion paper, we extend these arguments to the full interesting range x ≤ 0.99r for the unweighted character sum moments 1r-1 Σχ\; mod \; r |Σn ≤ x χ(n)|2q. This leads to a positive proportion non-vanishing result for Dirichlet theta functions θ(1,χ).
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.