Fici–Saari conjecture on the minimum number of binary abelian square factors
Let be the least number of distinct abelian square factors in a binary word of length . An abelian square is a factor whose two halves are abelian equivalent, that is, have the same Parikh vector.
Fici–Saari conjecture. Every binary word of length contains at least distinct abelian square factors; equivalently,
The conjecture is presented as being supported by computer experiments. Earlier results show that is unbounded, but the asserted exact minimum remains open.
References
- Gabriele Fici and Svetlana Puzynina, “Abelian Combinatorics on Words: a Survey”, arXiv:2207.09937 (2022).
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.