2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/68804Brandenburg 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.CombinatoricsDiscrete Mathematics68R15text