Critical exponents of words over 3 letters
The electronic journal of combinatorics, Tome 18 (2011) no. 1
For all $\alpha \geq RT(3)$ (where $RT(3) = 7/4$ is the repetition threshold for the $3$-letter alphabet), there exists an infinite word over 3 letters whose critical exponent is $\alpha$.
@article{10_37236_612,
author = {Elise Vaslet},
title = {Critical exponents of words over 3 letters},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/612},
zbl = {1217.68174},
url = {http://geodesic.mathdoc.fr/articles/10.37236/612/}
}
Elise Vaslet. Critical exponents of words over 3 letters. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/612
Cité par Sources :