| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625021 | Advances in Applied Mathematics | 2011 | 9 Pages |
Abstract
We prove the non-existence of recurrent words with constant Abelian complexity containing four or more distinct letters. This answers a question of Richomme et al.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
