Simultaneous avoidance of large squares and fractional powers in infinite binary words

Simple item page
dc.creatorShallit, Jeffrey
dc.date2003-04-29
dc.date.accessioned2026-07-07T04:57:34Z
dc.date.available2026-07-07T04:57:34Z
dc.descriptionIn 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where `4' is replaced by any integer. This results in an interesting and subtle hierarchy.
dc.identifierhttps://arxiv.org/abs/math/0304476
dc.identifierhttp://arxiv.org/abs/math/0304476
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67306
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subject68R15
dc.titleSimultaneous avoidance of large squares and fractional powers in infinite binary words
dc.typetext

Files

Collections

arXiv