The triple convolution conjecture for generalised divisor functions

For integers k,l,m≥2k,l,m\ge 2, define

T(dk,dl,dm;x,h):=∑n≤xdk(n+h)dl(n)dm(n−h).\mathcal{T}(d_k,d_l,d_m;x,h):=\sum_{n\le x}d_k(n+h)d_l(n)d_m(n-h).

For ϵ>0\epsilon>0 and 0<h≤x1−ϵ0<h\le x^{1-\epsilon}, the triple convolution conjecture.

T(dk,dl,dm;x,h)∼∇h,k,l,mx(log⁡x)k+l+m−3(k−1)!(l−1)!(m−1)!,\mathcal{T}(d_k,d_l,d_m;x,h)\sim \nabla_{h,k,l,m}\frac{x(\log x)^{k+l+m-3}}{(k-1)!(l-1)!(m-1)!},

as x→∞x\to\infty, where ∇h,k,l,m\nabla_{h,k,l,m} is the explicit Euler-product constant specified in the source, with g(u,v,w)=1g(u,v,w)=1 when the congruence system n≡−h(modu)n\equiv-h\pmod u, n≡0(modv)n\equiv0\pmod v, n≡h(modw)n\equiv h\pmod w has a solution and g(u,v,w)=0g(u,v,w)=0 otherwise. This generalises Browning's open conjecture for d(n+h)d(n)d(n−h)d(n+h)d(n)d(n-h); the paper establishes a lower bound of the correct order, but the asymptotic remains unproved.

References

Primary source

Bikram Misra and Biswajyoti Saha, “Triple convolution sums of the generalised divisor functions and related sums over primes”, arXiv:2509.04610 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.