Large sums of high order characters II
Alexander P. Mangerel, Yichen You

TL;DR
This paper establishes new upper bounds for the distribution of primitive characters of large order, improving previous results by removing restrictions on the modulus and order, and refines estimates for character sums.
Contribution
It introduces novel bounds for character level sets and enhances mean-squared estimates for character sums beyond Burgess' theorem for large order characters.
Findings
Non-trivial bounds for character level sets when $x > q^{ ext{delta}}$.
Refined mean-squared estimates for sums of $oldsymbol{ ext{chi}^ ext{l}}$ beyond Burgess.
Improved Pólya-Vinogradov inequality for characters with large even order.
Abstract
Let be a primitive character modulo , and let . Assuming that has large order , for any th root of unity we obtain non-trivial upper bounds for the number of such that , provided . This improves upon a previous result of the first author by removing restrictions on and . As a corollary, we deduce that if the largest prime factor of satisfies then the level set has such solutions whenever , for any fixed . Our proof relies, among other things, on a refinement of a mean-squared estimate for short sums of the characters , averaged over , due to the first author, which goes beyond Burgess' theorem as soon as is sufficiently large. We in fact show the alternative result that either…
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
TopicsCoding theory and cryptography · Finite Group Theory Research · Analytic Number Theory Research
