Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bilinear sums of Kloosterman sums, multiplicative congruences and average values of the divisor function over families of arithmetic progressions

Published 22 Nov 2018 in math.NT | (1811.09329v1)

Abstract: We obtain several asymptotic formulas for the sum of the divisor function $\tau(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.