Non-abelian amplification and bilinear forms with Kloosterman sums
Alexandru Pascadi

TL;DR
This paper develops a new Fourier-analytic method using non-abelian characters to bound bilinear sums of Kloosterman sums with composite moduli, leading to improved bounds and applications in number theory.
Contribution
Introduces a novel non-abelian Fourier analysis technique with amplification for bounding bilinear Kloosterman sums over composite moduli, extending previous prime modulus results.
Findings
Achieves non-trivial bounds for sums of length √c for most moduli.
Provides savings beyond the Pólya-Vinogradov range for all moduli.
Applies results to moments of twisted L-functions and large sieve inequalities.
Abstract
We introduce a new method to bound bilinear (Type II) sums of Kloosterman sums with composite moduli , using Fourier analysis on and an amplification argument with non-abelian characters. For sums of length , our method produces a non-trivial bound for all moduli except near-primes, saving for products of two primes of the same size. Combining this with previous results for prime moduli, we achieve savings beyond the P\'olya-Vinogradov range for all moduli. We give applications to moments of twisted cuspidal -functions, and to large sieve inequalities for exceptional cusp forms with composite levels.
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 · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
