Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the general additive divisor problem (1106.4744v2)

Published 23 Jun 2011 in math.NT

Abstract: We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the divisor function generated by $\zeta(s)k$. When $k=3$ the result improves, for $H\ge N{1/2}$, the bound given in the recent work \cite{[1]} of Baier, Browning, Marasingha and Zhao, who dealt with the case $k=3$.

Summary

We haven't generated a summary for this paper yet.