Recurrent words with constant Abelian complexity
Combinatorics
2009-11-30 v1
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.
Cite
@article{arxiv.0911.5151,
title = {Recurrent words with constant Abelian complexity},
author = {James Currie and Narad Rampersad},
journal= {arXiv preprint arXiv:0911.5151},
year = {2009}
}