The frequency and the structure of large character sums
Jonathan Bober, Leo Goldmakher, Andrew Granville, Dimitris, Koukoulopoulos

TL;DR
This paper analyzes the distribution and structure of large character sums for Dirichlet characters, revealing their typical behavior, the location of maximum sums, and establishing a universal distribution with exponential tail decay.
Contribution
It introduces a universal distribution for normalized large character sums, studies the location of their maxima, and connects these sums to $L$-values, providing new insights into their typical size and structure.
Findings
Distribution of $M( ext{chi})/\sqrt{q}$ converges to a universal distribution $$.
Most large sums occur for odd, 1-pretentious characters.
The maximum sum $M( ext{chi})$ is closely related to $|L(1, ext{chi})|$ and is typically bounded away from $q/2$.
Abstract
Let denote the maximum of for a given non-principal Dirichlet character , and let denote a point at which the maximum is attained. In this article we study the distribution of as one varies over characters , where is prime, and investigate the location of . We show that the distribution of converges weakly to a universal distribution , uniformly throughout most of the possible range, and get (doubly exponential decay) estimates for 's tail. Almost all for which is large are odd characters that are -pretentious. Now, , and one knows how often the latter expression is large, which has been how earlier lower bounds on were mostly proved. We show, though,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
