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

From MaRDI portal
Publication:5357409




Abstract: 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 a power-saving error term in the Titchmarsh divisor problem of estimating sumpleqxau(p1). 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 sumnleqxauk(n)au(n+1), reproving a result announced by Bykovskiu{i} and Vinogradov by a different method. The gain in the exponent is shown to be independent of k if a generalized Lindel"of hypothesis is assumed.




Cited in
(28)






This page was built for publication: Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357409)