Samsonov–Shur's conjecture on the Abelian repetition threshold
For a finite alphabet of size , let be the infimum of the real numbers for which there exists an infinite -ary Abelian -power-free word. The known lower bounds are
Samsonov–Shur's conjecture. The exact values are
At the time of the paper, no exact values of were known; the conjecture was proposed by Samsonov and Shur as a tightness assertion for their lower bounds. The present paper investigates these thresholds experimentally and shows that the proposed values are not correct in several cases.
References
- Elena A. Petrova and Arseny M. Shur, “Abelian Repetition Threshold Revisited”, arXiv:2109.09306 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.