A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
The electronic journal of combinatorics, Tome 23 (2016) no. 2
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
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/}
}
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 :