Attainable lengths for circular binary words avoiding k-powers
View Open
Metadata
Afficher la notice complèteDate
2005Citation
Bull. Belg. Math. Soc. Simon Stevin 4 (2005), 525–534.
Abstract
We show that binary circular words of length n avoiding 7/3+ powers exist
for every sufficiently large n. This is not the case for binary circular words
avoiding k+ powers with k < 7/3