Cubefree words with many squares

Thumbnail

View Open

Metadata

Show full item record

Author

Currie, James D.
Rampersad, Narad

Uri

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

Date

2014-05-13

Citation

Currie, James D., and Narad Rampersad. “Cubefree words with many squares.” Discrete Mathematics and Theoretical Computer Science 12(3) (2010): 29-34.

Abstract

We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.

Collections