The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We say that two finite words u and v are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an old question of G. Rauzy by exhibiting a class of words whose abelian complexity is everywhere equal toarXiv:0904.2925v1 fatcat:tto6ecib2berlgwgtgwm4rmx2e