2 problems

Matching

Petrova–Shur's conjecture on the Abelian repetition threshold
Petrova–Shur's conjecture. The Abelian repetition thresholds satisfy
openabelian-powers combinatorics-on-words repetition-threshold
06
Samsonov–Shur's conjecture on the Abelian repetition threshold
Samsonov–Shur's conjecture. The exact values are
openabelian-powers combinatorics-on-words repetition-threshold
06