On abelian and additive complexity in infinite words

2011/07/23 by Ardal, Hayri, Brown, Tom, Jungić, Veselin +1 · 1 citation
#05D99 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1107.4654

Abstract

The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We provide an alternative proof of one of the results of Richomme, Saari, and Zamboni.

Cited by

• A Lebesgue variant of the additive square problem

Related

• On additive complexity of infinite words
• Additive word complexity and Walnut
• On a generalization of Abelian equivalence and complexity of infinite words
• Avoiding Abelian powers in binary words with bounded Abelian complexity
• Recurrent words with constant Abelian complexity