A Generalization of Repetition Threshold

Simple item page
dc.creatorIlie, Lucian
dc.creatorShallit, Jeffrey
dc.date2003-10-10
dc.date.accessioned2026-07-07T05:01:47Z
dc.date.available2026-07-07T05:01:47Z
dc.descriptionBrandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number alpha such that there exists an infinite word over a k-letter alphabet that avoids beta-powers for all beta>alpha. We generalize this concept to include the lengths of the avoided words. We give some conjectures supported by numerical evidence and prove one of these conjectures.
dc.identifierhttps://arxiv.org/abs/math/0310144
dc.identifierhttp://arxiv.org/abs/math/0310144
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68804
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subject68R15
dc.titleA Generalization of Repetition Threshold
dc.typetext

Files

Collections

arXiv