2000 character limit reached
Large character sums: Burgess's theorem and zeros of $L$-functions
Published 8 Jan 2015 in math.NT | (1501.01804v2)
Abstract: We study the conjecture that $\sum_{n\leq x} \chi(n)=o(x)$ for any primitive Dirichlet character $\chi \pmod q$ with $x\geq q\epsilon$, which is known to be true if the Riemann Hypothesis holds for $L(s,\chi)$. We show that it holds under the weaker assumption that `$100\%$' of the zeros of $L(s,\chi)$ up to height $\tfrac 14$ lie on the critical line; and establish various other consequences of having large character sums.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.