English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $ \Lambda $ denote von Mangoldt's function, and consider the averages\begin{align*} A_N f (x) &=\frac{1}{N}\sum_{1\leq n \leq N}f(x-n)\Lambda(n) .\end{align*} We prove sharp $ \ell ^{p}$-improving for these averages, andsparse bounds for the maximal function. The simplest inequality is that forsets $ F, G\subset [0,N]$ there holds \begin{equation*} N ^{-1} \langle A_N\mathbf 1_{F} , \mathbf 1_{G} \rangle \ll \frac{\lvert F\rvert \cdot \lvertG\rvert} { N ^2 } \Bigl( \operatorname {Log} \frac{\lvert F\rvert \cdot \lvertG\rvert} { N ^2 } \Bigr) ^{t}, \end{equation*} where $ t=2$, or assuming theGeneralized Riemann Hypothesis, $ t=1$. The corresponding sparse bound isproved for the maximal function $ \sup_N A_N \mathbf 1_{F}$. The inequalitiesfor $ t=1$ are sharp. The proof depends upon the Circle Method, and aninterpolation argument of Bourgain.

Endpoint $ \ell ^{r}$ improving estimates for Prime averages