A generalization of repetition threshold Academic Article uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • Identity
  •  
  • Additional Document Info
  •  
  • View All
  •  

abstract

  • Brandenburg 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.

publication date

  • November 2005