Large Sums of High Order Characters
Alexander P. Mangerel

TL;DR
This paper proves new results about the distribution of high-order characters modulo a prime, showing they cannot cluster near 1 and exhibit cancellation in short sums, extending classical bounds and using advanced number theory techniques.
Contribution
It provides a new, simple proof of large sum properties of high-order characters and improves bounds on character sums, extending Burgess' theorem and related inequalities.
Findings
High-order characters do not cluster near 1 in short intervals.
Partial sums of high-order characters exhibit cancellation beyond Burgess' bounds.
Average improvements on Pólya-Vinogradov inequality for characters of prime order.
Abstract
Let be a primitive character modulo a prime , and let . It has previously been observed that if has large order then for some , in analogy with Vinogradov's conjecture on quadratic non-residues. We give a new and simple proof of this fact. We show, furthermore, that if is squarefree then for any th root of unity the number of such that is whenever . Consequently, when has sufficiently large order the sequence cannot cluster near for any . Our proof relies on a second moment estimate for short sums of the characters , averaged over , that is non-trivial whenever has no small prime factors. In particular, given any we…
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.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
