2 problems

Rauzy's conjecture. Except for very particular vectors of letter frequencies, there do not exist any infinite ternary words with constant abelian complexity equal to $3$.

Automatic-sequence regularity conjecture. The $k$-abelian complexity of any $\ell$-automatic sequence is an $\ell$-regular sequence.