On a certain additive divisor problem

Abstract

We prove an asymptotic formula for a variant of the binary additive divisor problem with linear factors in the arguments, which has a power saving error term and which is uniform in all involved parameters.

Theorem 1.2 corrected, references added, other minor changes

References in corpus (1)

• On binary and quadratic divisor problems

Cited by in corpus (7)

• The shifted convolution of generalized divisor functions
• Combinatorial identities and Titchmarsh's divisor problem for multiplicative functions
• The fourth moment of individual Dirichlet L-functions on the critical line
• Sign changes of Kloosterman sums and exceptional characters
• Large sieve inequalities for exceptional Maass forms and the greatest prime factor of $n^2+1$
• Mollification of the Fourth Moment of Dirichlet L-functions
• Mean values of long Dirichlet polynomials with divisor coefficients