We study the triple convolution sum of the generalised divisor functions given by ₍ ₗ dₖ (n+h) dₗ (n) dₘ (n-h), where h x^1-ε for any ε>0 and dₖ (n) denotes the generalised divisor function which counts the number of ways n can be written as product of k many positive integers. The purpose of this paper is two-fold. Firstly, we note a predicted asymptotic estimate for the above sum, where the constant appearing in the estimate can be obtained from the theory of Dirichlet series of several complex variables and also using some probabilistic arguments. Then we show that a lower bound of the correct order can be derived using the several variable Tauberian theorems, where, more importantly, the constant in the predicted asymptotic can be recovered.
MISRA et al. (Thu,) studied this question.