For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
The electronic journal of combinatorics, Tome 15 (2008)
The critical exponent of an infinite word ${\bf w}$ is the supremum of all rational numbers $\alpha$ such that ${\bf w}$ contains an $\alpha$-power. We resolve an open question of Krieger and Shallit by showing that for each $\alpha > 2$ there is an infinite binary word with critical exponent $\alpha$.
DOI :
10.37236/909
Classification :
68R15
Mots-clés : combinatorics on words, repetitions, critical exponent
Mots-clés : combinatorics on words, repetitions, critical exponent
@article{10_37236_909,
author = {James D. Currie and Narad Rampersad},
title = {For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/909},
zbl = {1183.68439},
url = {http://geodesic.mathdoc.fr/articles/10.37236/909/}
}
TY - JOUR AU - James D. Currie AU - Narad Rampersad TI - For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) JO - The electronic journal of combinatorics PY - 2008 VL - 15 UR - http://geodesic.mathdoc.fr/articles/10.37236/909/ DO - 10.37236/909 ID - 10_37236_909 ER -
James D. Currie; Narad Rampersad. For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \). The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/909
Cité par Sources :