GCD sums from Poisson integrals and systems of dilated functions
Christoph Aistleitner, Istvan Berkes, and Kristian Seip

TL;DR
This paper establishes optimal bounds for GCD sums using Poisson integrals, resolving longstanding problems on the almost everywhere behavior of dilated function systems.
Contribution
It introduces a novel Poisson integral approach to bound GCD sums and applies these bounds to solve key problems in the almost everywhere convergence and growth of dilated function systems.
Findings
Proved optimal bounds for GCD sums for 0<α≤1.
Solved a 1986 problem of Dyer and Harman for α=1/2.
Established a Carleson--Hunt-type inequality for systems of dilated functions.
Abstract
Upper bounds for GCD sums of the form [\sum_{k,{\ell}=1}^N\frac{(\gcd(n_k,n_{\ell}))^{2\alpha}}{(n_k n_{\ell})^\alpha}] are proved, where is any sequence of distinct positive integers and ; the estimate for solves in particular a problem of Dyer and Harman from 1986, and the estimates are optimal except possibly for . The method of proof is based on identifying the sum as a certain Poisson integral on a polydisc; as a byproduct, estimates for the largest eigenvalues of the associated GCD matrices are also found. The bounds for such GCD sums are used to establish a Carleson--Hunt-type inequality for systems of dilated functions of bounded variation or belonging to , a result that in turn settles two longstanding problems on the a.e.\ behavior of systems of dilated functions: the a.e. growth of sums of the form…
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.
