Square-free shuffles of words

Abstract: Let

u s h u f f l e v

denote the set of all shuffles of the words

u

and

v

. It is shown that for each integer

n g e q 3

there exists a square-free ternary word

u

of length

n

such that

u s h u f f l e u

contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word

u

on three letters such that

u

can be shuffled with itself to produce an infinite square-free word

w i n u s h u f f l e u

.

Recommendations

Cites Work

Cited In (17)

This page was built for publication: Square-free shuffles of words