Averages Along the Primes: Improving and Sparse Bounds
Abstract
Consider averages along the prime integers P given by equation* AN f (x) = N -1 Σ p ∈ P \;:\; p≤ N ( p) f (x-p). equation* These averages satisfy a uniform scale-free p-improving estimate. For all 1< p < 2, there is a constant Cp so that for all integer N and functions f supported on [0,N], there holds equation* N -1/p' AN fp' ≤ Cp N - 1/p fp. equation* The maximal function A f =N AN f satisfies (p,p) sparse bounds for all 1< p < 2. The latter are the natural variants of the scale-free bounds. As a corollary, A is bounded on p (w), for all weights w in the Muckenhoupt Ap class. No prior weighted inequalities for A were known.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.