A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
The electronic journal of combinatorics, Tome 23 (2016) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern $xyzxzyx$. In fact, wecharacterize all the (two-way) infinite ternary square-free words avoiding letter pattern $xyzxzyx$characterize the lexicographically least (one-way) infinite ternary square-free word avoiding letter pattern $xyzxzyx$show that the number of ternary square-free words of length $n$ avoiding letter pattern $xyzxzyx$ grows exponentially with $n$.
DOI : 10.37236/6003
Classification : 05A05, 68R15
Mots-clés : words avoiding patterns, square-free words
@article{10_37236_6003,
     author = {James Currie},
     title = {A ternary square-free sequence avoiding factors equivalent to \(abcacba\)},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {2},
     doi = {10.37236/6003},
     zbl = {1337.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6003/}
}
TY  - JOUR
AU  - James Currie
TI  - A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6003/
DO  - 10.37236/6003
ID  - 10_37236_6003
ER  - 
%0 Journal Article
%A James Currie
%T A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/6003/
%R 10.37236/6003
%F 10_37236_6003
James Currie. A ternary square-free sequence avoiding factors equivalent to \(abcacba\). The electronic journal of combinatorics, Tome 23 (2016) no. 2. doi: 10.37236/6003

Cité par Sources :