Endpoint ^r improving estimates for prime averages

DOI10.4310/MRL.2022.V29.N6.A6MaRDI QIDQ6043367zbMATH OpenOpenAlexFDO

Authors Michael T. Lacey, Hamed Mousavi, Yaghoub Rahimi

Publication date 5 May 2023

Published in Mathematical Research Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.10401

zbMATH Keywords

prime averagesvon Mangoldt's function

Mathematics Subject Classification ID

Distribution of primes (11N05) Asymptotic results on arithmetic functions (11N37) Applications of the Hardy-Littlewood method (11P55)

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 $el{l}^p$-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 $su{p}_N{A}_{N}mathbf{1}_F$. The inequalities for $t=1$ are sharp. The proof depends upon the Circle Method, and an interpolation argument of Bourgain.

Review text

The authors of the paper under review consider discrete averages over the prime integers, where the averages are weighted by the von Mangoldt function. They prove sharp \(\ell^p\)- improving for these averages, and sparse bounds for the maximal function. There are stated unconditional results, and those that depend upon the Generalized Riemann Hypothesis. The proof uses the circle method to approximate the Fourier multiplier, following [\textit{J. Bourgain}, Isr. J. Math. 61, No. 1, 73--84 (1988; Zbl 0642.28011)]. In the unconditional case, a classical theorem by Page is used, which leads to the appearance of exceptional characters in the circle method. The results and their connections with harmonic analysis are too complicated to be stated here.

Recommendations

• Averages along the primes: improving and sparse bounds
• Quantitative \(l^p\)-improving for discrete spherical averages along the primes
• Improving and maximal inequalities for primes in progressions
• Variational estimates for averages and truncated singular integrals along the prime numbers
• Averaging with the divisor function: \(\ell^p\)-improving and sparse bounds

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)