Combinatorics on words

Combinatorics on words
Name	Combinatorics on words
Discipline	Mathematics
Subdiscipline	Discrete mathematics
Notable people	Marston Morse, Gustav A. Hedlund, Eugène Prouhet, Axel Thue, Marcel-Paul Schützenberger, Gian-Carlo Rota, Jean Berstel, Dominique Perrin, Juris Hartmanis, John E. Hopcroft, Christiane Frougny, Jean-Marc Champarnaud, Alfred V. Aho, Richard M. Karp, Stanisław Ulam, Donald Knuth, Morris Newman, Jean-Pierre Allouche, Jeffrey Shallit, James D. Currie, François Durand, Günter F. R. Führer, Fedor Fomin, Sébastien Labbé, Éric Fusy, Anna Karlin, Michael Sipser, Endre Szemerédi, Paul Erdős, Donald E. Knuth, Miklós Laczkovich, Nikos S. Nikolopoulos, Wolfgang Schmidt, Alfredo Hubard, Bruno Durand, Claude Berge, Jean-Pierre Serre, Gustav Lejeune Dirichlet, Otakar Borůvka, Lothar Collatz, Hugo Steinhaus, Andrzej Schinzel, Ilya Piatetski-Shapiro, Oded Goldreich, Sanjeev Arora, Leslie Valiant, Peter Shor, Leonard Adleman, Moses Schönfinkel, Haskell Curry, Andrey Kolmogorov, Gregory Chaitin, Richard Bellman

Combinatorics on words Combinatorics on words is a branch of mathematics studying sequences of symbols drawn from finite alphabets and the structural, algebraic, and algorithmic properties of such sequences. It grew from early work by Axel Thue and developed through contributions by Marston Morse, Gustav A. Hedlund, Marcel-Paul Schützenberger, and later researchers like Jean-Pierre Allouche, Jeffrey Shallit, and Jean Berstel. The field connects to topics in automata theory, formal language theory, number theory, and symbolic dynamics through problems about patterns, morphisms, and complexity.

Definition and basic concepts

A word is a finite sequence over a finite alphabet; infinite sequences are studied as well, with key notions including factors, prefixes, suffixes, borders, and conjugacy introduced by early work of Axel Thue, Marston Morse, and Gustav A. Hedlund. Central combinatorial invariants include factor complexity (subword complexity), recurrence, uniform recurrence, and balance, concepts analyzed by Morse and Bertrand in symbolic dynamics and refined by Jean-Pierre Allouche and Jeffrey Shallit. Algebraic frameworks such as free monoids and free semigroups trace to classical algebraists like Gian-Carlo Rota and interact with the work of Marcel-Paul Schützenberger on formal power series and recognizable languages studied by Noam Chomsky-influenced formalisms. Metric and measure-theoretic properties of shift spaces are linked to contributions by Yakov Sinai and Harry Furstenberg.

Patterns and avoidance

Pattern avoidance began with problems by Axel Thue on square-free and cube-free words and was advanced by researchers including Paul Erdős, Endre Szemerédi, and Jean-Paul Allouche. Avoidability of patterns, equivalence of pattern classes, and the existence of infinite words avoiding given patterns are studied with tools from Ramsey theory and combinatorial number theory exemplified in work by Erdős and Szemerédi. Notions such as abelian squares, pattern matching, and unavoidability involve techniques developed by Donald Knuth, Richard M. Karp, and Alfred V. Aho in stringology, while extremal results have connections to problems addressed by Paul Erdős and Paul Turán.

Morphisms and substitutions

Morphisms (also called substitutions) map letters to words and generate fixed points and substitutive sequences; classical examples include the Thue–Morse sequence from Axel Thue and Marston Morse and the Fibonacci word linked to Édouard Lucas and Fibonacci. Primitive substitutions, Pisot substitutions, and constant-length morphisms are central in the study of spectral properties pursued by Jean-Pierre Allouche, Martin Lothaire (collective), and researchers in symbolic dynamics such as Michel Herman. Algebraic properties of substitution dynamical systems relate to work by Siegfried Echterhoff and results in ergodic theory by Yakov Sinai and Herman Weyl.

Finite and infinite words (automatic and Sturmian words)

Finite words are core to combinatorial enumeration studied by Gian-Carlo Rota and Richard Stanley, while infinite words include automatic sequences (generated by finite automata) with seminal work by Christiane Frougny, Jean-Marc Champarnaud, and Shallit and Sturmian words characterized by low complexity and connections to rotations on the circle studied by Marston Morse, Gustav A. Hedlund, and Vojtěch Jarník. Sturmian sequences link to continued fractions and Diophantine approximation addressed by Émile Borel and Kurt Mahler, and automatic sequences intersect with finite automaton theory from John E. Hopcroft and Jeffrey Ullman. Regularity properties connect to work by Michael Sipser and computability results explored by Juris Hartmanis and Alan Turing.

Algorithmic problems and complexity

Decision problems in word combinatorics include pattern matching, word equations, unification, and membership in language classes; foundational algorithms by Alfred V. Aho, Richard M. Karp, and Donald Knuth underpin practical string algorithms. Complexity classifications draw on computational complexity theory by Michael Sipser, Richard M. Karp, and Leslie Valiant, while hardness results for constraints and word equations echo reductions from Stephen Cook and Leonid Levin. Algorithmic decidability for word equations was advanced by Stuart M. Ginsburg and resolved in complexity terms through work influenced by Yuri Matiyasevich and later complexity refinements by Diego Trancón y Widemann and others in theoretical computer science.

Applications and connections to other fields

Applications span coding theory, where constrained sequences meet work of Claude Shannon and Richard Hamming; bioinformatics, using string matching algorithms from Alfred V. Aho and Gene Myers; and quasicrystals, where substitution tilings connect to physics research by Roger Penrose and mathematical crystallography by Bruno Durand. Connections also reach number theory via automaticity and normal numbers studied by Émile Borel and Kurt Mahler, to formal language theory with roots in Noam Chomsky and automata theory from John E. Hopcroft and Jeffrey Ullman, and to combinatorial group theory influenced by Max Dehn and Olivier G. Schramm. Interdisciplinary links involve algorithmic information theory by Andrey Kolmogorov and Gregory Chaitin and applications in data compression tied to work by Jacob Ziv and Abraham Lempel.

Category:Combinatorics