Averages Along the Primes: Improving and Sparse Bounds
Rui Han, Ben Krause, Michael Lacey, Fan Yang

TL;DR
This paper establishes scale-free $ ext{ell}^p$-improving estimates and sparse bounds for averages along prime numbers, leading to new weighted inequalities for the associated maximal function.
Contribution
It introduces novel scale-free $ ext{ell}^p$-improving and sparse bounds for prime averages, enabling the first weighted inequalities for the maximal function along primes.
Findings
Proves uniform scale-free $ ext{ell}^p$-improving estimates for prime averages.
Establishes $ (p,p)$ sparse bounds for the maximal function for all $ 1< p < 2$.
Demonstrates boundedness of the maximal function on weighted $ ext{ell}^p(w)$ spaces for $ w$ in $ A_p$.
Abstract
Consider averages along the prime integers 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 -improving estimate. For all , there is a constant so that for all integer and functions supported on , 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 satisfies sparse bounds for all . The latter are the natural variants of the scale-free bounds. As a corollary, is bounded on , for all weights in the Muckenhoupt class. No prior weighted inequalities for $…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Mathematical Approximation and Integration
