Infinite Words with very Low Factor Complexity: an introduction to Combinatorics on Words
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 (due to J. Cassaigne and the author, 2022) and develop its consequences.
Cite
@article{arxiv.2603.07816,
title = {Infinite Words with very Low Factor Complexity: an introduction to Combinatorics on Words},
author = {Mélodie Andrieu},
journal= {arXiv preprint arXiv:2603.07816},
year = {2026}
}
Comments
This text is based on a lecture delivered during the 7th edition of the international conference Dyadisc, held in Valpara\'iso, Chile, in December 2024