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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study averages along the integers using the divisor function $d(n)$, anddefined as $$K_N f (x) = \frac{1}{D(N)} \sum _{n \leq N} d(n) \,f(x+n) , $$where $D(N) = \sum _{n=1} ^N d(n) $. We shall show that these averages satisfya uniform, scale free $\ell^p$-improving estimate for $p \in (1,2)$, that is $$\left( \frac{1}{N} \sum |K_Nf|^{p'} \right)^{1/p'} \lesssim \left(\frac{1}{N}\sum |f|^p \right)^{1/p} $$ as long as $f$ is supported on $[0,N]$.  We also show that the associated maximal function $K^*f = \sup_N |K_N f|$satisfies $(p,p)$ sparse founds for $p \in (1,2)$, which implies that $K^*$ isbounded on $\ell ^p (w)$ for $p \in (1, \infty )$, for all weights $w$ in theMuckenhoupt $A_p$ class.

Averaging with the Divisor Function: $\ell^p$-improving and Sparse Bounds