Geodesic
There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
The electronic journal of combinatorics, Tome 9 (2002)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

There are circular square-free words of length $n$ on three symbols for $n\ge 18$. This proves a conjecture of R. J. Simpson.
DOI : 10.37236/1671
Classification : 68R15, 68Q45, 20M05, 05B45, 05B30
Mots-clés : combinatorics on words, square-free words 
@article{10_37236_1671,
     author = {James D. Currie},
     title = {There are ternary circular square-free words of length \(n\) for \(n \geq\) 18},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     doi = {10.37236/1671},
     zbl = {1057.68081},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1671/}
}
TY  - JOUR
AU  - James D. Currie
TI  - There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1671/
DO  - 10.37236/1671
ID  - 10_37236_1671
ER  - 
%0 Journal Article
%A James D. Currie
%T There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1671/
%R 10.37236/1671
%F 10_37236_1671
James D. Currie. There are ternary circular square-free words of length \(n\) for \(n \geq\) 18. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1671

Cité par Sources :