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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

A $d$-subsequence of a sequence $\varphi = x_1\dots x_n$ is a subsequence$x_i x_{i+d} x_{i+2d} \dots$, for any positive integer $d$ and any $i$, $1 \lei \le n$. A \textit{$k$-Thue sequence} is a sequence in which every$d$-subsequence, for $1 \le d \le k$, is non-repetitive, i.e. it contains noconsecutive equal subsequences. In 2002, Grytczuk proposed a conjecture thatfor any $k$, $k+2$ symbols are enough to construct a $k$-Thue sequences ofarbitrary lengths. So far, the conjecture has been confirmed for $k \in\{1,2,3,5\}$. Here, we present two different proving techniques, and confirm itfor all $k$, with $2 \le k \le 8$.

On non-repetitive sequences of arithmetic progressions:the cases $k \in \{4,5,6,7,8\}$