GCD sums from Poisson integrals and systems of dilated functions
Abstract
Upper bounds for GCD sums of the form [Σk,=1N((nk,n))2α(nk n)α] are proved, where (nk)1 ≤ k ≤ N is any sequence of distinct positive integers and 0<α 1; the estimate for α=1/2 solves in particular a problem of Dyer and Harman from 1986, and the estimates are optimal except possibly for α=1/2. 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 12, 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 Σk=1N f(nk x) and the a.e.\ convergence of Σk=1∞ ck f(nkx) when f is 1-periodic and of bounded variation or in 12.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.