Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method

By S. Drappeau. 2015

59 citations recorded by the source corpus.

We prove a bound for quintilinear sums of Kloosterman sums, with congruence conditions on the ‘smooth’ summation variables. This generalizes classical work of Deshouillers and Iwaniec, and is key to obtaining power‐saving error terms in applications, notably the dispersion method. As a consequence, assuming the Riemann hypothesis for Dirichlet L ‐functions, we prove power‐saving error term in the Titchmarsh divisor problem of estimating ∑p⩽xτ(p−1) . Unconditionally, we isolate the possible contribution of Siegel zeroes, showing it is always negative. Extending work of Fouvry and Tenenbaum, we obtain power‐saving in the asymptotic formula for ∑n⩽xτk(n)τ(n+1) , reproving a result announced by Bykovskiĭ and Vinogradov by a different method. The gain in the exponent is shown to be independent of k if a generalized Lindelöf hypothesis is assumed.

Subfields: Algebra and Number Theory, Applied Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/6948eaf69709d875742d0fd6443a6707d0564187