Square-free words with square-free self-shuffles (Q405075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Square-free words with square-free self-shuffles |
scientific article; zbMATH DE number 6340107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Square-free words with square-free self-shuffles |
scientific article; zbMATH DE number 6340107 |
Statements
Square-free words with square-free self-shuffles (English)
0 references
4 September 2014
0 references
Summary: We answer a question of \textit{T. Harju} [Lect. Notes Comput. Sci. 8079, 154--160 (2013; Zbl 1309.68163)]: For every \(n\geq 3\) there is a square-free ternary word of length \(n\) with a square-free self-shuffle.
0 references
combinatorics on words
0 references
square-free words
0 references
self shuffles
0 references
0.88560950756073
0 references
0.8796539306640625
0 references
0.8687372803688049
0 references
0.847182035446167
0 references
0.8054799437522888
0 references
