Endpoint ^r improving estimates for prime averages

From MaRDI portal
Publication:6043367




Abstract: Let Lambda denote von Mangoldt's function, and consider the averages �egin{align*} A_N f (x) &=frac{1}{N}sum_{1leq n leq N}f(x-n)Lambda(n) . end{align*} We prove sharp ellp-improving for these averages, and sparse bounds for the maximal function. The simplest inequality is that for sets F,Gsubset[0,N] there holds �egin{equation*} N ^{-1} langle A_N mathbf 1_{F} , mathbf 1_{G} angle ll frac{lvert F vert cdot lvert G vert} { N ^2 } Bigl( operatorname {Log} frac{lvert F vert cdot lvert G vert} { N ^2 } Bigr) ^{t}, end{equation*} where t=2, or assuming the Generalized Riemann Hypothesis, t=1. The corresponding sparse bound is proved for the maximal function supNANmathbf1F. The inequalities for t=1 are sharp. The proof depends upon the Circle Method, and an interpolation argument of Bourgain.










This page was built for publication: Endpoint \(\ell^r\) improving estimates for prime averages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043367)