On a group theoretic generalization of the Morse-Hedlund theorem
From MaRDI portal
(Redirected from Publication:5270140)
Abstract: In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word over a non empty finite alphabet contains at least distinct factors of each length They further showed that an infinite word has exactly distinct factors of each length if and only if is binary, aperiodic and balanced, i.e., is a Sturmian word. In this paper we obtain a broad generalization of the Morse-Hedlund theorem via group actions. Given a subgroup of the symmetric group let denote the number of distinct -orbits of Since is a subgroup of it acts on by permutation. Thus, given an infinite word and an infinite sequence of subgroups we consider the complexity function which counts for each length the number of equivalence classes of factors of of length under the action of We show that if is aperiodic, then for each and moreover, if equality holds for each then is Sturmian. Conversely, let be a Sturmian word. Then for every infinite sequence of Abelian subgroups there exists such that for each is isomorphic to and Applying the above results to the sequence where is the trivial subgroup of consisting only of the identity, we recover both directions of the Morse-Hedland theorem.
Recommendations
Cites work
- Abelian complexity of minimal subshifts
- Balanced words and majorization
- Characterisations of balanced words via orderings
- Complexity of short rectangles and periodicity
- Cyclic complexity of words
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Long cycles in \(abc\)-permutations
- Maximal pattern complexity for discrete systems
- Multidimensional extension of the Morse-Hedlund theorem
- On an involution of Christoffel words and Sturmian morphisms
- On Christoffel classes
- Optimization and majorization of invariant measures
- Palindrome complexity.
- Sequences with minimal block growth
- Some combinatorial properties of Sturmian words
- Sturmian words, Lyndon words and trees
- Sturmian words: structure, combinatorics, and their arithmetics
- Subword complexities of various classes of deterministic developmental languages without interactions
- Symbolic Dynamics II. Sturmian Trajectories
- The number of factors in a paperfolding sequence
- The rectangle complexity of functions on two-dimensional lattices
- Which beta-shifts have a largest invariant measure?
Cited in
(10)- On the Haagerup inequality and groups acting on \(\tilde A_ n\)-buildings
- Sequences of symmetry groups of infinite words
- On Heyde's theorem on the group \(\mathbb{R} \times \mathbb{T} \)
- Open and closed factors in Arnoux-Rauzy words
- Cyclic complexity of words
- scientific article; zbMATH DE number 7069796 (Why is no real title available?)
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence
- The reflection complexity of sequences over finite alphabets
- Small abelian complexity of multidimensional words
- Symmetry groups of infinite words
This page was built for publication: On a group theoretic generalization of the Morse-Hedlund theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270140)