Infinite words containing squares at every position

Simple item page
dc.creatorCurrie, James D.
dc.creatorRampersad, Narad
dc.date2008-03-07
dc.date2008-04-04
dc.date.accessioned2026-07-07T13:02:58Z
dc.date.available2026-07-07T13:02:58Z
dc.descriptionRichomme asked the following question: what is the infimum of the real numbers $α$ > 2 such that there exists an infinite word that avoids $α$-powers but contains arbitrarily large squares beginning at every position? We resolve this question in the case of a binary alphabet by showing that the answer is $α$ = 7/3.
dc.description12 pages; minor revisions and clarifications
dc.identifierhttps://arxiv.org/abs/0803.1189
dc.identifierhttp://arxiv.org/abs/0803.1189
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226636
dc.subjectCombinatorics
dc.subjectFormal Languages and Automata Theory
dc.subject68R15
dc.titleInfinite words containing squares at every position
dc.typetext

Files

Collections

arXiv