{ "id": "1301.5104", "version": "v1", "published": "2013-01-22T08:27:59.000Z", "updated": "2013-01-22T08:27:59.000Z", "title": "On a generalization of Abelian equivalence and complexity of infinite words", "authors": [ "Juhani Karhumaki", "Aleksi Saarela", "Luca Q. Zamboni" ], "categories": [ "math.CO", "cs.DM" ], "abstract": "In this paper we introduce and study a family of complexity functions of infinite words indexed by $k \\in \\ints ^+ \\cup {+\\infty}.$ Let $k \\in \\ints ^+ \\cup {+\\infty}$ and $A$ be a finite non-empty set. Two finite words $u$ and $v$ in $A^*$ are said to be $k$-Abelian equivalent if for all $x\\in A^*$ of length less than or equal to $k,$ the number of occurrences of $x$ in $u$ is equal to the number of occurrences of $x$ in $v.$ This defines a family of equivalence relations $\\thicksim_k$ on $A^*,$ bridging the gap between the usual notion of Abelian equivalence (when $k=1$) and equality (when $k=+\\infty).$ We show that the number of $k$-Abelian equivalence classes of words of length $n$ grows polynomially, although the degree is exponential in $k.$ Given an infinite word $\\omega \\in A^\\nats,$ we consider the associated complexity function $\\mathcal {P}^{(k)}_\\omega :\\nats \\rightarrow \\nats$ which counts the number of $k$-Abelian equivalence classes of factors of $\\omega$ of length $n.$ We show that the complexity function $\\mathcal {P}^{(k)}$ is intimately linked with periodicity. More precisely we define an auxiliary function $q^k: \\nats \\rightarrow \\nats$ and show that if $\\mathcal {P}^{(k)}_{\\omega}(n)