2017
DOI: 10.4007/annals.2017.186.2.2
|View full text |Cite
|
Sign up to set email alerts
|

Bilinear forms with Kloosterman sums and applications

Abstract: We prove non-trivial bounds for general bilinear forms in hyper-Kloosterman sums when the sizes of both variables may be below the range controlled by Fourier-analytic methods (Pólya-Vinogradov range). We then derive applications to the second moment of cusp forms twisted by characters modulo primes, and to the distribution in arithmetic progressions to large moduli of certain Eisenstein-Hecke coefficients on GL3. Our main tools are new bounds for certain complete sums in three variables over finite fields, pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
92
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 51 publications
(92 citation statements)
references
References 39 publications
0
92
0
Order By: Relevance
“…We recall that for individual values of a the limit of our current methods is q ď x 2{3´ε for an arbitrary fixed ε ą 0 . Our method builds on an approach due to Blomer (2008) based on the Voronoi summation formula which we combine with some recent results on bilinear sums of Kloosterman sums due Kowalski, Michel and Sawin (2017) and Shparlinski (2017). We also make use of extra applications of the Voronoi summation formulae after expanding into Kloosterman sums and this reduces the problem to estimating the number of solutions to multiplicative congruences.…”
mentioning
confidence: 99%
“…We recall that for individual values of a the limit of our current methods is q ď x 2{3´ε for an arbitrary fixed ε ą 0 . Our method builds on an approach due to Blomer (2008) based on the Voronoi summation formula which we combine with some recent results on bilinear sums of Kloosterman sums due Kowalski, Michel and Sawin (2017) and Shparlinski (2017). We also make use of extra applications of the Voronoi summation formulae after expanding into Kloosterman sums and this reduces the problem to estimating the number of solutions to multiplicative congruences.…”
mentioning
confidence: 99%
“…This technique goes back to Karatsuba and Vinogradov (for the function x → χ(x + 1)). It has been also used by Friedlander-Iwaniec [FI85] (for the function x → e x q ), Fouvry-Michel [FM98] and Kowalski-Michel-Sawin [KMS17,KMS18].…”
Section: Advanced Completions Methods: the +Ab Shiftmentioning
confidence: 99%
“…where (α m ) m∼M , (β n ) n∼N are sequences of complex numbers of modulus bounded by 1. We leave it to the interested reader to fill in the details (or to look at [FM98,KMS17] or [KMS18]). The first step is to apply Cauchy-Schwarz to smooth out the n variable: for a suitable smooth function V , compactly supported in [1/2, 5/2] and bounded by 1, one has m∼M,n∼N α m β n K(mn) N 1/2 m1,m2∼M α m1 α m2 n V ( n N )K(m 1 n)K(m 2 n) 1/2 .…”
Section: Advanced Completions Methods: the +Ab Shiftmentioning
confidence: 99%
See 1 more Smart Citation
“…So we have chosen to avoid the completion step, in order to simplify an already complex argument. It should be noted however that, for small values of l, the completion step is worth pursuing, and that is was crucial in [KMS17] to obtain non-trivial bounds for l " 2 (which was the only case that could be handled in [KMS17], because, as noted earlier, the diagonal variety in that paper was of codimension 1).…”
mentioning
confidence: 96%