Attainable lengths for circular binary words avoiding k-powers

Thumbnail

View Open

Metadata

Show full item record

Author

Currie, James D.
Aberkane, Ali

Uri

http://hdl.handle.net/10680/1752

Date

2005

Doi

10.36045/bbms/1133793340

Citation

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

Collections