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

We determine a class of rearrangements that admit a supporting tree. Thiscondition implies that the associated rearrangement operator has a boundedvector valued extension. We show that there exists a large subspace of $L^p$ onwhich a bounded rearrangement operator acts as an isomorphism. Thecombinatorial issues of these problems give rise to a two-person game, to beplayed with colored dyadic intervals. We determine winning strategies for eachof the players.

Rearrangements with supporting Trees, Isomorphisms and Combinatorics of coloured dyadic Intervals