Additive divisor problem for multiplicative functions

Abstract

Let τ 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 Σn ≤ Xf(n)τ(n-1). We also derive several applications to multiplicative functions in the automorphic context, including the functions λπ(n), \,μ(n)λπ(n) and λφ(n)l. Here λπ(n) denotes the n-th Dirichlet coefficient of GLm automorphic L-function L(s,π) for an automorphic irreducible cuspidal representation π, λφ(n) denotes the n-th Fourier coefficient of a holomorphic or Maass cusp form φ on SL2( Z), and μ(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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…