Inversion formulas for Dirichlet series (Q1113936)

Let \(f(n)=(d_ kN^ a\chi_ 1*d_{\ell}N^ b\chi_ 2)(n)\) where \(N(n)=n\) for any positive n, \(d_ k(n)\) the number of solutions of \(n_ 1... n_ k=n\), \(\chi_ 1,\chi_ 2\) characters modulo \(q_ 1,q_ 2\) respectively, \(k,\ell,q_ 1,q_ 2\) positive integers and \(0\leq b\leq a\). This function f(n) generalizes the functions \(d_ k(n)\), \(\sigma_ a(n)\) (sum of the a-th powers of the divisors of n) and \((\chi_ 1*\chi_ 2)(n).\) Using a method analogous to the method of \textit{R. G. Ayoub} and \textit{S. Chowla} [J. Number Theory 2, 342-344 (1970; Zbl 0198.375)] the authors obtain an asymptotic formula for the sum \(\sum_{n\leq x}f(n) \log^ r(x/n)\) with \(r>(k+\ell +2ka+2\ell b-1)/2\) integer with error-term of order \(x^{-(r-ka-\ell b+)/(k+\ell)}.\)