Rational exponential sums over the divisor function

MaRDI QIDQ6245033zbMATH OpenFDO

Authors Bryce Kerr

Publication date 23 September 2013

Abstract: We consider a problem posed by Shparlinski, of giving nontrivial bounds for rational exponential sums over the arithmetic function $au(n)$, counting the number of divisors of $n$. This is done using some ideas of Sathe concerning the distribution in residue classes of the function $omega(n)$, counting the number of prime factors of $n$, to bring the problem into a form where, for general modulus, we may apply a bound of Bourgain concerning exponential sums over subgroups of finite abelian groups and for prime modulus some results of Korobov and Shkredov.

This page was built for publication: Rational exponential sums over the divisor function

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