Cyclic Equalizability Characterized by Parikh Vectors
The paper characterizes cyclic equalizability for two words over any finite alphabet. It proves that two words are cyclically equalizable if and only if they possess the same Parikh vector, which counts the occurrences of each character. This generalizes previous results for binary alphabets and shows that cyclic equalizability is equivalent to Abelian equivalence.