MathDB3 problems
Matching
Limit conjecture. The repetition thresholds of rich words satisfy
Petrova–Shur's conjecture. The Abelian repetition thresholds satisfy
Samsonov–Shur's conjecture. The exact values are
Limit conjecture. The repetition thresholds of rich words satisfy
Petrova–Shur's conjecture. The Abelian repetition thresholds satisfy
Samsonov–Shur's conjecture. The exact values are