Square-free words with square-free self-shuffles (Q405075): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:33, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Square-free words with square-free self-shuffles |
scientific article |
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
