Sums of Kloosterman sums over primes in an arithmetic progression
Alexander Dunn, Alexandru Zaharescu

TL;DR
This paper estimates sums of Kloosterman sums over primes in arithmetic progressions, extending previous results on cancellation in sums of Kloosterman sums over primes, using advanced bilinear form bounds and oscillatory integral asymptotics.
Contribution
It introduces a novel optimization method comparing three bounds for bilinear forms involving Kloosterman sums, including new uniform asymptotics and stationary phase analysis.
Findings
Achieves cancellation estimates for sums of Kloosterman sums over primes in arithmetic progressions.
Develops a new bilinear bound using uniform asymptotics for oscillatory integrals.
Utilizes deep existing bilinear bounds to improve analysis of Kloosterman sum sums.
Abstract
For prime, and coprime we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where denotes a normalised Kloosterman sum with modulus . This is a sparse analogue of a recent theorem due to Blomer, Fouvry, Kowalski, Michel and Mili\'cevi\'c showing cancellation amongst sums of Kloosterman sums over primes in short intervals. We use an optimisation argument inspired by Fouvry, Kowalski and Michel. Our argument compares three different bounds for bilinear forms involving Kloosterman sums. The first input in this method is a bilinear bound we prove using uniform asymptotics for oscillatory integrals due to Kiral, Petrow and Young. In contrast with the case when the sum runs over all primes, we exploit cancellation over a sum of…
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.
