The divisor function in arithmetic progressions to smooth moduli
From MaRDI portal
Abstract: By using the -analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus . We show that the expected asymptotic formula holds for a larger range of than was previously known, provided that has a certain factorisation.
Recommendations
Cited in
(18)- Kloosterman paths and the shape of exponential sums
- Squarefree Integers in Arithmetic Progressions to Smooth Moduli
- On almost-prime k-tuples
- Remark on Smith’s result on a divisor problem in arithmetic progressions
- Variance of the $k$-fold divisor function in arithmetic progressions for individual modulus
- Arithmetic exponent pairs for algebraic trace functions and applications
- Non-vanishing of Dirichlet L-functions with smooth conductors
- On the restricted divisor function in arithmetic progressions
- The divisor function in arithmetic progressions modulo prime powers
- The distribution of square-free integers in arithmetic progressions with prime power moduli
- The arcsine law on divisors in arithmetic progressions modulo prime powers
- Limitations to equidistribution in arithmetic progressions
- Divisor problem in arithmetic progressions modulo a prime power
- Ternary divisor functions in arithmetic progressions to smooth moduli
- A lower bound for the variance of generalized divisor functions in arithmetic progressions
- Exponential sums with reducible polynomials
- Lectures on applied ℓ-adic cohomology
- On algebraic twists with composite moduli
This page was built for publication: The divisor function in arithmetic progressions to smooth moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450451)