rich_repetition_threshold
def
The repetition threshold RT(C_d) for d-ary rich words is the infimum of the set S_d of critical exponents of uniformly recurrent d-ary rich words.
Statement
noncomputable def rich_repetition_threshold (d : ℕ) : ℝ
- Defined in
- arXiv:2611.13676 Sec. 1, Sec. 8
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- rich_word_critical_exponentsFor any positive integer d, the set S_d of critical exponents of uniformly recurrent d-ary rich words is the collection of all real…
- Used by 1
- op_1458_rich_repetition_threshold_le_asymptotic_of_projectionFor any integer d ≥ 2, if there exist a morphism π : Fin (2 * d - 1) → List (Fin d) and an infinite word z : ℕ → Fin d such that z is the…
Read back from the Lean
rich_repetition_threshold d is defined as the infimum (in ℝ) of the set of critical exponents of all uniformly recurrent rich infinite words over an alphabet of size d (represented by Fin d).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The repetition threshold for d-ary rich words is the infimum of S_d. -/ noncomputable def rich_repetition_threshold (d : ℕ) : ℝ := sInf (rich_word_critical_exponents d)