Additive divisor problem for multiplicative functions

preprint2022arXivOpen access

Abstract

Let ττ 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 ∑n≤Xf(n)τ(n−1)\sum_{n \leq X}f(n)τ(n-1). We also derive several applications to multiplicative functions in the automorphic context, including the functions λπ(n), μ(n)λπ(n)λ_π(n), \,μ(n)λ_π(n) and λϕ(n)lλ_ϕ(n)^l. Here λπ(n)λ_π(n) denotes the nn-th Dirichlet coefficient of GLm\text{GL}_m automorphic LL-function L(s,π)L(s,π) for an automorphic irreducible cuspidal representation ππ, λϕ(n)λ_ϕ(n) denotes the nn-th Fourier coefficient of a holomorphic or Maass cusp form ϕϕ on SL2(Z){\rm SL}_2(\mathbb Z), and μ(n)μ(n) denotes the Möbius 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átai-Sarnak-Ziegler criterion and Linnik's dispersion method are both employed in these two arguments.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.