The shifted convolution of generalized divisor functions
Berke Topacogullari

TL;DR
This paper establishes an asymptotic formula for the shifted convolution of generalized divisor functions with a uniform error term, advancing previous results in the field.
Contribution
It provides a new asymptotic formula for the shifted convolution of divisor functions with improved error bounds and uniformity in the shift parameter.
Findings
Asymptotic formula for shifted convolution of divisor functions with power-saving error
Uniformity in the shift parameter
Improvement over previous results by Fouvry, Tenenbaum, and Drappeau
Abstract
We prove an asymptotic formula for the shifted convolution of the divisor functions and with , which is uniform in the shift parameter and which has a power-saving error term, improving results obtained previously by Fouvry and Tenenbaum and, more recently, by Drappeau.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
