13 problems
Effective-partition conjecture. The word contains at least
Fazekas–Mammoliti–Mercaş–Simpson conjecture. A binary word of length contains at least
Mäkelä's conjecture. There exists an infinite ternary word whose only abelian square factors are , , and .
Fici–Saari conjecture. Every binary word of length contains at least distinct abelian square factors; equivalently,
For a circular binary word of length , let denote the minimum number of distinct abelian squares it contains. The circular minimum conjecture. The minimum number is … i…
For a binary linear word of length , let be the minimum number of distinct abelian squares it contains. Fici–Saarela's conjecture. … and the only words of length …
For a binary linear word of length , let be the minimum number of non-equivalent abelian squares it contains. Fraenkel–Paterson–Simpson's conjecture. For every positive…
For a binary word of length , let denote the maximum number of non-equivalent abelian squares it contains. Kucherov et al.'s conjecture. … The conjecture proposes a pol…
Let a word of length contain distinct abelian square factors. Fici–Mignosi's conjecture. There exists a binary word of length containing at least distinct abelian s…
Two abelian squares are inequivalent when they have different Parikh vectors, where the Parikh vector records the number of occurrences of each letter. Let be a positive intege…
For a finite word, an abelian-square factor is a factor formed by concatenating two anagrams of one another. Let be a positive integer, and let be the number of distinct ab…
Two abelian squares are inequivalent when they have different Parikh vectors. Inequivalent-abelian-square bound conjecture. Every word of length contains inequiv…
For a finite word, an abelian square is a factor formed by concatenating two anagrammatic words. Binary-word maximality conjecture. If a word of length contains distinct ab…