On the general additive divisor problem

Details On the general additive divisor problem On the general additive divisor problem

2011-06-23

arxiv.org/abs/1106.4744v2

Mathematics

Number Theory

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

On the general additive divisor problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the general additive divisor problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the general additive divisor problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-470020