On a certain additive divisor problem
From MaRDI portal
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.
Recommendations
Cited in
(18)- An additive divisor problem with a growing number of factors
- A quadratic divisor problem
- On the binary additive divisor problem
- The fourth moment of individual Dirichlet \(L\)-functions on the critical line
- Mean values of long Dirichlet polynomials with higher divisor coefficients
- Level of distribution of quadratic polynomials and an upper bound sieve for friable integers
- Combinatorial identities and Titchmarsh's divisor problem for multiplicative functions
- A weighted divisor problem
- scientific article; zbMATH DE number 1589355 (Why is no real title available?)
- scientific article; zbMATH DE number 4031804 (Why is no real title available?)
- Sign changes of Kloosterman sums and exceptional characters
- Mollification of the fourth moment of Dirichlet L-functions
- On the quadratic divisor problem
- On the binary additive divisor problem in mean
- Triple correlations of ternary divisor functions. II
- A twisted additive divisor problem
- Large sieve inequalities for exceptional Maass forms and the greatest prime factor of n^2+1
- Mean values of long Dirichlet polynomials with divisor coefficients
This page was built for publication: On a certain additive divisor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595450)