Algebraic Combinatorics on Words

Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.

M. Lothaire (Author)

9780521812207, Cambridge University Press

Hardback, published 18 April 2002

520 pages
23.4 x 15.6 x 2.9 cm, 0.838 kg

Review of the hardback: '… an indispensable reference …' Mathematika

Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

1. Finite and infinite words J. Berstel and D. Perrin
2. Sturmian words J. Berstel and P. Séébold
3. Unavoidable patterns J. Cassaigne
4. Sesquipowers A. De Luca and S. Varricchio
5. The plactic monoid A. Lascoux, B. Leclerc and J.-Y. Thibon
6. Codes V. Bruyère
7. Numeration systems C. Frougny
8. Periodicity F. Mignosi and A. Restivo
9. Centralisers of noncommutative series and polynomials C. Reutenauer
10. Transformations on words and q-calculus D. Foata and G.-N. Han
11. Statistics on permutations and words J. Désarménien
12. Makanin's algorithm V. Diekert
13. Independent systems of equations T. Harju, J. Karhumäki and W. Plandowski.

Subject Areas: Combinatorics & graph theory [PBV], Algebra [PBF]