2000 character limit reached
A Discrete Carleson Theorem Along the Primes with a Restricted Supremum (1604.08695v1)
Published 29 Apr 2016 in math.CA
Abstract: Consider the discrete maximal function acting on finitely supported functions on the integers, [ \mathcal{C}\Lambda f(n) := \sup{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e{2\pi i \lambda p}}{p} |,] where $\pm \mathbb{P} := { \pm p : p \text{ is a prime} }$, and $\Lambda \subset [0,1]$. We give sufficient conditions on $\Lambda$, met by (finite unions of) lacunary sets, for this to be a bounded sublinear operator on $\ellp(\mathbb{Z})$ for $\frac{3}{2} < p < 4$.