Geodesic
Avoiding letter patterns in ternary square-free words
Elena A. Petrova1
1Ural Federal University
The electronic journal of combinatorics, Tome 23 (2016) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl
We consider special patterns of lengths 5 and 6 in a ternary alphabet. We show that some of them are unavoidable in square-free words and prove avoidability of the other ones. Proving the main results, we use Fibonacci words as codes of ternary words in some natural coding system and show that they can be decoded to square-free words avoiding the required patterns. Furthermore, we estimate the minimal local (critical) exponents of square-free words with such avoidance properties.
DOI : 10.37236/5424
Classification : 68R15
Mots-clés : square-free ternary word, pattern avoidability, Fibonacci word, letter pattern

Elena A. Petrova  1

1 Ural Federal University 
Elena A. Petrova. Avoiding letter patterns in ternary square-free words. The electronic journal of combinatorics, Tome 23 (2016) no. 1. doi: 10.37236/5424
@article{10_37236_5424,
     author = {Elena A. Petrova},
     title = {Avoiding letter patterns in ternary square-free words},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {1},
     doi = {10.37236/5424},
     zbl = {1337.68218},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5424/}
}
TY  - JOUR
AU  - Elena A. Petrova
TI  - Avoiding letter patterns in ternary square-free words
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5424/
DO  - 10.37236/5424
ID  - 10_37236_5424
ER  - 
%0 Journal Article
%A Elena A. Petrova
%T Avoiding letter patterns in ternary square-free words
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/5424/
%R 10.37236/5424
%F 10_37236_5424

Cité par Sources :