We survey known results and open problems in abelian combinatorics on words. Abelian
combinatorics on words is the extension to the commutative setting of the classical theory of …

A shuffle of two strings is formed by interleaving the characters into a new string, keeping the
characters of each string in order. A string is a square if it is a shuffle of two identical strings …

Книга представляет собой краткое, но математически строгое введение в анализ
различных алгоритмов с точки зрения доказывания их правильности. Вы ознакомитесь …

Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of
positions. We investigate the maximum length of twins in a random word over ak-letter …

The Shuffle Product: New Research Directions Page 1 The Shuffle Product: New Research
Directions Antonio Restivo(B) Dipartimento di Matematica e Informatica, Universit`a di …

A\emph {square} is a word of the form $ UU $, where $ U $ is any finite nonempty word. For
instance, $\mathtt {\color {red}{0102}\color {blue}{0102}} $ is a square. A\emph {shuffle …

A successor to the first and second editions, this updated and revised book is a leading
companion guide for students and engineers alike, specifically software engineers who …

Let SS k (n) be the family of shuffle squares in [k] 2 n, words that can be partitioned into two
disjoint identical subsequences. Let RSS k (n) be the family of reverse shuffle squares in [k] …

We study an abstract variant of squares (and shuffle squares) defined by a constraint graph
G, specifying which pairs of words form a square. So, a shuffle G-square is a word that can …

A shuffle of two words is formed by interleaving the characters into a new word, keeping the
characters of each word in order. A word is a shuffle square if it is a shuffle of two identical …