Additive divisor problem for multiplicative functions
Abstract: Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq X}f(n)\tau(n-1)$. We also derive several applications to multiplicative functions in the automorphic context, including the functions $\lambda_{\pi}(n), \,\mu(n)\lambda_{\pi}(n)$ and $\lambda_{\phi}(n)l$. Here $\lambda_{\pi}(n)$ denotes the $n$-th Dirichlet coefficient of $\text{GL}m$ automorphic $L$-function $L(s,\pi)$ for an automorphic irreducible cuspidal representation $\pi$, $\lambda{\phi}(n)$ denotes the $n$-th Fourier coefficient of a holomorphic or Maass cusp form $\phi$ on ${\rm SL}_2(\mathbb Z)$, and $\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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.