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/

Zendy Plus

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

Zendy Tools

Zendy Open

We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter[Algorithmica 1995] and, using arguments based on Lyndon words, derive a moregeneral variant which considers three overlapping squares which do notnecessarily share a common prefix. We also give an improved upper bound of$n\log_2 n$ on the maximum number of (occurrences of) primitively rootedsquares in a string of length $n$, also using arguments based on Lyndon words.To the best of our knowledge, the only known upper bound was $n \log_\phi n\approx 1.441n\log_2 n$, where $\phi$ is the golden ratio, reported by Fraenkeland Simpson [TCS 1999] obtained via the Three Squares Lemma.

Lyndon Words, the Three Squares Lemma, and Primitive Squares