| dc.contributor.author | Currie, James D. | |
| dc.contributor.author | Rampersad, Narad | |
| dc.date.accessioned | 2018-01-16T15:03:18Z | |
| dc.date.available | 2018-01-16T15:03:18Z | |
| dc.date.issued | 2014-05-13 | |
| dc.identifier.citation | Currie, James D., and Narad Rampersad. “Cubefree words with many squares.” Discrete Mathematics and Theoretical Computer Science 12(3) (2010): 29-34. | en_US |
| dc.identifier.issn | 1462-7264 | |
| dc.identifier.uri | http://hdl.handle.net/10680/1351 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | The first author is supported by an NSERC Discovery Grant. The second author is supported by an NSERC Postdoctoral Fellowship. | |
| dc.description.uri | http://dmtcs.episciences.org/486 | |
| dc.language.iso | en | en_US |
| dc.publisher | Discrete Mathematics and Theoretical Computer Science | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Cubefree words | en_US |
| dc.subject | Squares | |
| dc.title | Cubefree words with many squares | en_US |
| dc.type | Article | en_US |
