On a group theoretic generalization of the Morse-Hedlund theorem
Emilie Charlier, Svetlana Puzynina, Luca Q. Zamboni

TL;DR
This paper generalizes the Morse-Hedlund theorem using group actions, establishing bounds on factor complexity of infinite words based on subgroup orbits, and characterizes Sturmian words through these bounds.
Contribution
It introduces a group-theoretic framework to extend the Morse-Hedlund theorem, connecting factor complexity with subgroup orbits and characterizing Sturmian words.
Findings
For aperiodic words, complexity is at least the number of subgroup orbits plus one.
Equality in complexity characterizes Sturmian words.
The classical Morse-Hedlund theorem is recovered as a special case.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
