Recurrent words with constant Abelian complexity

Abstract

We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al.