ON ABELIAN VERSIONS OF CRITICAL FACTORIZATION THEOREM
In the paper we study abelian versions of the critical factorization theorem. We investigate both similarities and differences between the abelian powers and the usual powers. The results we obtained show that the constraints for abelian powers implying periodicity should be quite strong, but still natural analogies exist.
periodicity combinatorics on words central factorization theorem abelian properties of words