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

summary:For any $x\in [0,1)$, let $x=[\epsilon _1,\epsilon _2,\cdots ,]$ be its dyadic expansion. Call $r_n(x):=\max \{j\geq 1\colon  \epsilon _{i+1}=\cdots =\epsilon _{i+j}=1$, $0\leq i\leq n-j\}$ the $n$-th maximal run-length function of $x$. P. Erdös and A. Rényi showed that $\lim _{n\to \infty }{r_n(x)}/{\log _2 n}=1$ almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose run-length function assumes on other possible asymptotic behaviors than $\log _2 n$, is quantified by their Hausdorff dimension

The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching