Critical exponent of a word

Known as: Repetition threshold 
In mathematics and computer science, the critical exponent of a finite or infinite sequence of symbols over a finite alphabet describes the largest… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2017
02419892017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest number r for which there… (More)
Is this relevant?
2012
2012
 
Is this relevant?
2011
2011
For all α ≥ RT (3) (where RT (3) = 7/4 is the repetition threshold for the 3-letter alphabet), there exists an infinite word over… (More)
Is this relevant?
2011
2011
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet… (More)
Is this relevant?
2007
2007
Dejean conjectured that the repetition threshold of a k-letter alphabet is k/(k−1), k = 3, 4. Values of the repetition threshold… (More)
  • table 1
Is this relevant?
2007
2007
We estimate the extremal letter frequency in infinite words over a finite alphabet avoiding some repetitions. For ternary square… (More)
Is this relevant?
2004
2004
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
Let us fix a conformal class [g0] and a spin structure σ on a compact manifold M . For any g ∈ [g0], let λ1 (g) be the smallest… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Moulin Ollagnier, J., Proof of Dejean’s conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters, Theoretical Computer… (More)
Is this relevant?