English

A triple convolution sum of the divisor function

Number Theory 2025-09-03 v3

Abstract

We study the triple convolution sum of the divisor function given by nxd(n)d(nh)d(n+h)\sum_{n\leq x} d(n)d(n-h)d(n+h) for h0h\neq 0 and d(n)d(n) denotes the number of positive divisors of nn. Based on algebraic and geometric considerations, Browning conjectured that the above sum is asymptotic to chx(logx)3c_hx(\log x)^3, for a suitable constant ch0c_h\neq 0, as xx\to \infty. This conjecture is still unproved. Using sieve-theoretic results of Wolke and Nair (respectively), it is possible to derive the exact order of the sum. The lower bound of the correct order of magnitude can also be derived by very elementary arguments. In this paper, using the Tauberian theory for multiple Dirichlet series, we prove an explicit lower bound and provide a new theoretical framework to predict Browning's conjectured constant chc_h.

Keywords

Cite

@article{arxiv.2508.13082,
  title  = {A triple convolution sum of the divisor function},
  author = {Bikram Misra and M. Ram Murty and Biswajyoti Saha},
  journal= {arXiv preprint arXiv:2508.13082},
  year   = {2025}
}
R2 v1 2026-07-01T04:55:09.226Z