Papers
Topics
Authors
Recent
2000 character limit reached

GCD sums from Poisson integrals and systems of dilated functions

Published 2 Oct 2012 in math.NT, math.CA, math.CV, and math.FA | (1210.0741v5)

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

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.