On the general additive divisor problem

Publication date 17 September 2014

Abstract: We obtain a new upper bound for

s u m_{h l e H} D e l t a_{k} (N, h)

for

1 l e H l e N

,

k i n N

,

k g e 3

, where

D e l t a_{k} (N, h)

is the (expected) error term in the asymptotic formula for

s u m_{N < n l e 2 N} d_{k} (n) d_{k} (n + h)

, and

d_{k} (n)

is the divisor function generated by

z e t a (s)^{k}

. When

k = 3

the result improves, for

H g e 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

.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: On the general additive divisor problem