Averages Along the Primes: Improving and Sparse Bounds

preprint2020arXivOpen access

Abstract

Consider averages along the prime integers P \mathbb P given by \begin{equation*} \mathcal{A}_N f (x) = N ^{-1} \sum_{ p \in \mathbb P \;:\; p\leq N} (\log p) f (x-p). \end{equation*} These averages satisfy a uniform scale-free ℓp \ell ^{p}-improving estimate. For all 1<p<2 1< p < 2, there is a constant Cp C_p so that for all integer N N and functions f f supported on [0,N] [0,N], there holds \begin{equation*} N ^{-1/p' }\lVert \mathcal{A}_N f\rVert_{\ell^{p'}} \leq C_p N ^{- 1/p} \lVert f\rVert_{\ell^p}. \end{equation*} The maximal function A∗f=sup⁡N∣ANf∣ \mathcal{A}^{\ast} f =\sup_{N} \lvert \mathcal{A}_N f \rvert satisfies (p,p) (p,p) sparse bounds for all 1<p<2 1< p < 2. The latter are the natural variants of the scale-free bounds. As a corollary, A∗ \mathcal{A}^{\ast} is bounded on ℓp(w) \ell ^{p} (w), for all weights w w in the Muckenhoupt ApA_p class. No prior weighted inequalities for A∗ \mathcal{A}^{\ast} were known.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.