Infinite Words with very Low Factor Complexity: an introduction to Combinatorics on Words
M\'elodie Andrieu

TL;DR
This paper introduces the study of infinite words with minimal factor complexity, exploring their properties, classifications, and connections to dynamics, algebra, and arithmetic, including classical and new results.
Contribution
It presents a comprehensive introduction to low complexity infinite words, including a new algebraic proof of Tijdeman's theorem and its implications.
Findings
Characterization of minimal complexity infinite words
Introduction of classical and new combinatorial tools
A new algebraic proof of Tijdeman's theorem
Abstract
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following guiding questions: What is the minimal complexity of a non-trivial infinite word over a binary, ternary, or more generally finite alphabet? How should ''non-triviality'' be formalized? Which words achieve this minimal complexity? Are there many? Are they interesting? In exploring these questions, we introduce classical objects and tools from combinatorics on words -- such as Sturmian words and Rauzy graphs -- as well as little-known and new results. In particular, the third chapter is devoted to a theorem by R. Tijdeman from 1999, which generalizes a seminal result of M. Morse and G. Hedlund from 1938. We provide a new, algebraic proof of this theorem…
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.
Taxonomy
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Algorithms and Data Compression
