Papers › Avoiding abelian and additive powers in rich words
Avoiding abelian and additive powers in rich words
Jonathan Andrade, Lucas Mol
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper concerns the avoidability of abelian and additive powers in infinite rich words. In particular, we construct an infinite additive 5-power-free rich word over {0,1} and an infinite additive 4-power-free rich word over {0, 1, 2}. The alphabet sizes are as small as possible in both cases, even for abelian powers.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections