English

Additive divisor problem for multiplicative functions

Number Theory 2022-04-19 v1

Abstract

Let τ\tau denote the divisor function, and ff be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum nXf(n)τ(n1)\sum_{n \leq X}f(n)\tau(n-1). We also derive several applications to multiplicative functions in the automorphic context, including the functions λπ(n),μ(n)λπ(n)\lambda_{\pi}(n), \,\mu(n)\lambda_{\pi}(n) and λϕ(n)l\lambda_{\phi}(n)^l. Here λπ(n)\lambda_{\pi}(n) denotes the nn-th Dirichlet coefficient of GLm\text{GL}_m automorphic LL-function L(s,π)L(s,\pi) for an automorphic irreducible cuspidal representation π\pi, λϕ(n)\lambda_{\phi}(n) denotes the nn-th Fourier coefficient of a holomorphic or Maass cusp form ϕ\phi on SL2(Z){\rm SL}_2(\mathbb Z), and μ(n)\mu(n) denotes the M\"obius function. We present two different arguments. The first one mainly relies on the uniform estimates for the binary additive divisor problem, while the second is based on the recent estimates of Bettin--Chandee for trilinear forms in Kloosterman fractions. In addition, the Bourgain-K\'atai-Sarnak-Ziegler criterion and Linnik's dispersion method are both employed in these two arguments.

Keywords

Cite

@article{arxiv.2204.08221,
  title  = {Additive divisor problem for multiplicative functions},
  author = {Yujiao Jiang and Guangshi Lü},
  journal= {arXiv preprint arXiv:2204.08221},
  year   = {2022}
}
R2 v1 2026-06-24T10:50:46.216Z