Square-free words with square-free self-shuffles
The electronic journal of combinatorics, Tome 21 (2014) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We answer a question of Harju: For every $n\ge 3$ there is a square-free ternary word of length $n$ with a square-free self-shuffle.
DOI : 10.37236/3605
Classification : 68R15
Mots-clés : combinatorics on words, square-free words, self shuffles

James D. Currie  1   ; Kalle Saari  1

1 University of Winnipeg
@article{10_37236_3605,
     author = {James D. Currie and Kalle Saari},
     title = {Square-free words with square-free self-shuffles},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {1},
     doi = {10.37236/3605},
     zbl = {1297.68191},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3605/}
}
TY  - JOUR
AU  - James D. Currie
AU  - Kalle Saari
TI  - Square-free words with square-free self-shuffles
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3605/
DO  - 10.37236/3605
ID  - 10_37236_3605
ER  - 
%0 Journal Article
%A James D. Currie
%A Kalle Saari
%T Square-free words with square-free self-shuffles
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/3605/
%R 10.37236/3605
%F 10_37236_3605
James D. Currie; Kalle Saari. Square-free words with square-free self-shuffles. The electronic journal of combinatorics, Tome 21 (2014) no. 1. doi: 10.37236/3605

Cité par Sources :