On a group theoretic generalization of the Morse-Hedlund theorem

preprint2015arXivOpen access

Abstract

In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word x∈AN,x\in A^N, over a non empty finite alphabet A,A, contains at least n+1n+1 distinct factors of each length n.n. They further showed that an infinite word xx has exactly n+1n+1 distinct factors of each length nn if and only if xx is binary, aperiodic and balanced, i.e., xx is a Sturmian word. In this paper we obtain a broad generalization of the Morse-Hedlund theorem via group actions. Given a subgroup GG of the symmetric group Sn,S_n, let 1≤ε(G)≤n1\leq ε(G)\leq n denote the number of distinct GG-orbits of {1,2,…,n}.\{1,2,\ldots ,n\}. Since GG is a subgroup of Sn,S_n, it acts on An={a1a2⋯an ∣ ai∈A}A^n=\{a_1a_2\cdots a_n\,|\,a_i\in A\} by permutation. Thus, given an infinite word x∈ANx\in A^N and an infinite sequence ω=(Gn)n≥1ω=(G_n)_{n\geq 1} of subgroups Gn⊆Sn,G_n \subseteq S_n, we consider the complexity function pω,x:N→Np_{ω,x}:N \rightarrow N which counts for each length nn the number of equivalence classes of factors of xx of length nn under the action of Gn.G_n. We show that if xx is aperiodic, then pω,x(n)≥ε(Gn)+1p_{ω, x}(n)\geqε(G_n)+1 for each n≥1,n\geq 1, and moreover, if equality holds for each n,n, then xx is Sturmian. Conversely, let xx be a Sturmian word. Then for every infinite sequence ω=(Gn)n≥1ω=(G_n)_{n\geq 1} of Abelian subgroups Gn⊆Sn,G_n \subseteq S_n, there exists ω′=(Gn′)n≥1ω'=(G_n')_{n\geq 1} such that for each n≥1:n\geq 1: Gn′⊆SnG_n'\subseteq S_n is isomorphic to GnG_n and pω′,x(n)=ε(Gn′)+1.p_{ω',x}(n)=ε(G'_n)+1. Applying the above results to the sequence (Idn)n≥1,(Id_n)_{n\geq 1}, where IdnId_n is the trivial subgroup of SnS_n consisting only of the identity, we recover both directions of the Morse-Hedland theorem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.