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 exhibit subshifts admitting weakly mixing (probability) measures, forarbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup\frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, saidsubshifts can be made to satisfy $p(q) < q + f(q)$ infinitely often.  We establish that every subshift associated to a rank-one transformation (ona probability space) which is not an odometer satisfies $\limsup p(q) - 1.5q =\infty$ and that this is optimal for rank-ones.

Word Complexity of (Measure-Theoretically) Weakly Mixing Rank-One Subshifts