The typical size of character and zeta sums is o(x)o(\sqrt{x})

preprint2023arXivOpen access

Abstract

We prove conjecturally sharp upper bounds for the Dirichlet character moments 1r−1∑χ  mod  r∣∑n≤xχ(n)∣2q\frac{1}{r-1} \sum_{χ\; \text{mod} \; r} |\sum_{n \leq x} χ(n)|^{2q}, where rr is a large prime, 1≤x≤r1 \leq x \leq r, and 0≤q≤10 \leq q \leq 1 is real. In particular, if both xx and r/xr/x tend to infinity with rr then 1r−1∑χ  mod  r∣∑n≤xχ(n)∣=o(x)\frac{1}{r-1} \sum_{χ\; \text{mod} \; r} |\sum_{n \leq x} χ(n)| = o(\sqrt{x}), and so the sums ∑n≤xχ(n)\sum_{n \leq x} χ(n) typically exhibit "better than squareroot cancellation". We prove analogous better than squareroot bounds for the moments 1T∫0T∣∑n≤xnit∣2qdt\frac{1}{T} \int_{0}^{T} |\sum_{n \leq x} n^{it}|^{2q} dt of zeta sums; of Dirichlet theta functions θ(1,χ)θ(1,χ); and of the sums ∑n≤xh(n)χ(n)\sum_{n \leq x} h(n) χ(n), where h(n)h(n) is any suitably bounded multiplicative function (for example the Möbius function μ(n)μ(n)). The proofs depend on similar better than squareroot cancellation phenomena for low moments of random multiplicative functions. An important ingredient is a reorganisation of the conditioning arguments from the random case, so that one only needs to "condition" on a small collection of fairly short prime number sums. The conditioned quantities arising can then be well approximated by twisted second moments, whose behaviour is the same for character and zeta sums as in the random case.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.