Additive divisor conjecture with a power-saving error term
Additive divisor conjecture with a power-saving error term
Let be natural numbers, let be large, and let satisfy . Let , and let , , , and be the quantities defined in the source. Additive divisor conjecture. There exists a positive constant such that
and, for every ,
uniformly for . Moreover, the coefficient of in is . This conjecture gives a refined asymptotic framework for shifted divisor correlations, including an explicit local leading coefficient and a conjectural error exponent; the source does not resolve the conjectured bound.
Sources & referencesView supporting material
Primary source
Nathan Ng and Mark Thom, “Bounds and Conjectures for additive divisor sums”, arXiv:1609.01411 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.