English

GCD sums from Poisson integrals and systems of dilated functions

Number Theory 2013-11-12 v5 Classical Analysis and ODEs Complex Variables Functional Analysis

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 (nk)1kN(n_k)_{1 \leq k \leq N} is any sequence of distinct positive integers and 0<α10<\alpha \le 1; the estimate for α=1/2\alpha=1/2 solves in particular a problem of Dyer and Harman from 1986, and the estimates are optimal except possibly for α=1/2\alpha=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 \lip12\lip12, 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=1Nf(nkx)\sum_{k=1}^N f(n_k x) and the a.e.\ convergence of k=1ckf(nkx)\sum_{k=1}^\infty c_k f(n_kx) when ff is 1-periodic and of bounded variation or in \lip12\lip12.

Keywords

Cite

@article{arxiv.1210.0741,
  title  = {GCD sums from Poisson integrals and systems of dilated functions},
  author = {Christoph Aistleitner and Istvan Berkes and Kristian Seip},
  journal= {arXiv preprint arXiv:1210.0741},
  year   = {2013}
}