Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 11 Jan 2023 in math.NT

Abstract: We prove conjecturally sharp upper bounds for the Dirichlet character moments $\frac{1}{r-1} \sum_{\chi \; \text{mod} \; r} |\sum_{n \leq x} \chi(n)|{2q}$, where $r$ is a large prime, $1 \leq x \leq r$, and $0 \leq q \leq 1$ is real. In particular, if both $x$ and $r/x$ tend to infinity with $r$ then $\frac{1}{r-1} \sum_{\chi \; \text{mod} \; r} |\sum_{n \leq x} \chi(n)| = o(\sqrt{x})$, and so the sums $\sum_{n \leq x} \chi(n)$ typically exhibit "better than squareroot cancellation". We prove analogous better than squareroot bounds for the moments $\frac{1}{T} \int_{0}{T} |\sum_{n \leq x} n{it}|{2q} dt$ of zeta sums; of Dirichlet theta functions $\theta(1,\chi)$; and of the sums $\sum_{n \leq x} h(n) \chi(n)$, where $h(n)$ is any suitably bounded multiplicative function (for example the M\"{o}bius function $\mu(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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.