For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)

zbMath1183.68439arXiv0802.4095MaRDI QIDQ1010692

Narad Rampersad, James D. Currie

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.4095

zbMATH Keywords

critical exponentrepetitionscombinatorics on words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

The critical exponent functions ⋮ Squares and cubes in Sturmian sequences ⋮ Binary words with a given Diophantine exponent

This page was built for publication: For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)