Cubefree words with many squares

Simple item page
dc.creatorCurrie, James
dc.creatorRampersad, Narad
dc.date2008-11-19
dc.date.accessioned2026-07-07T13:03:08Z
dc.date.available2026-07-07T13:03:08Z
dc.descriptionWe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0811.3233
dc.identifierhttp://arxiv.org/abs/0811.3233
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226688
dc.subjectCombinatorics
dc.subjectFormal Languages and Automata Theory
dc.subject68R15
dc.titleCubefree words with many squares
dc.typetext

Files

Collections

arXiv