Abelian maximal pattern complexity of words

Abstract In this paper, we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection. We show that in the case of binary words, the bound is actually achieved and gives a characterization of recurrent aperiodic words.

[1]  Ethan M. Coven,et al.  Sequences with minimal block growth II , 1973, Mathematical systems theory.

[2]  Hui Rao,et al.  Maximal pattern complexity of words over l letters , 2006, Eur. J. Comb..

[3]  Teturo Kamae,et al.  Maximal pattern complexity for discrete systems , 2002, Ergodic Theory and Dynamical Systems.

[4]  G. A. Hedlund,et al.  Symbolic Dynamics II. Sturmian Trajectories , 1940 .

[5]  Ethan M. Coven,et al.  Sequences with minimal block growth , 2005, Mathematical systems theory.

[6]  Gwénaël Richomme,et al.  Abelian complexity of minimal subshifts , 2009, J. Lond. Math. Soc..

[7]  Luca Q. Zamboni,et al.  Sequence entropy and the maximal pattern complexity of infinite words , 2002, Ergodic Theory and Dynamical Systems.