The origins of combinatorics on words

We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. These considerations gave rise to early results such as those of Axel Thue at the beginning of the 20th century. Other early results were obtained as a by-product of investigations on various combinatorial objects. For example, paths in graphs are encoded by words in a natural way, and conversely, the Cayley graph of a group or a semigroup encodes words by paths. We give in this text an account of this two-sided interaction.

[1]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[2]  J. Nielsen,et al.  Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden , 1917 .

[3]  L. Dickson.  History of the Theory of Numbers , 1924, Nature.

[4]  Alan Cobham,et al.  Uniform tag sequences , 1972, Mathematical systems theory.

[5]  Sergei Ivanovich Adian,et al.  The Burnside problem and identities in groups , 1979 .

[6]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[7]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[8]  Henry Crapo,et al.  On lacets and their manifolds , 2001, Discret. Math..

[9]  B. Grünbaum.  Arrangements and Spreads , 1972 .

[10]  S. Chowla.  On a problem of arrangements , 1939 .

[11]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[12]  B. H. Neumann.  Adjunction of Elements To Groups , 1943 .

[13]  Magnus Steinby,et al.  Trees and Term Rewriting in 1910 : On a Paperby Axel Thue , 2007 .

[14]  J. Spencer.  Ramsey Theory , 1990 .

[15]  Walther Dyck.  Gruppentheoretische Studien. II. Ueber die Zusammensetzung einer Gruppe discreter Operationen, über ihre Primitivität und Transitivität , 1883 .

[16]  Eugène Catalan.  Addition à la note sur une équation aux différences finies, insérée dans le volume précédent, page 508 , 1839 .

[17]  J. Hadamard,et al.  Les surfaces a courbures opposees et leurs lignes geodesique , 1898 .

[18]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[19]  de Ng Dick Bruijn,et al.  Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of $2^n$ zeros and ones that show each n-letter word exactly once , 1975 .

[20]  J. A. Todd,et al.  A practical method for enumerating cosets of a finite abstract group , 1936 .

[21]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[22]  C. W. Borchardt.  Ueber eine der Interpolation entsprechende Darstellung der Eliminations-Resultante. , 1860 .

[23]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[24]  J. Shepherdson,et al.  Computer programming and formal systems , 1965 .

[25]  Olga Kharlampovich,et al.  Tarski’s problem about the elementary theory of free groups has a positive solution , 1998 .

[26]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[27]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[28]  Thomas W. Hungerford,et al.  The Structure of Rings , 1974 .

[29]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[30]  David Burton.  Elementary Number Theory , 1976 .

[31]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.

[32]  Frederic B. Fitch.  Review: W. V. Quine, Concatenation as a Basis for Arithmetic , 1948 .

[33]  Philotheus Boehner.  Review: Jan Lukasiewicz, Aristotle's Syllogistic from the Standpoint of Modern Formal Logic , 1952 .

[34]  Andrzej Ehrenfeucht,et al.  The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable , 1982, Theor. Comput. Sci..

[35]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[36]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[37]  P. Glaister.  Logarithmic series , 2003 .

[38]  M. Lothaire.  Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .

[39]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[40]  H. Furstenberg.  Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .

[41]  G. N. Raney.  Functional composition patterns and power series reversion , 1960 .

[42]  J. Green,et al.  On semi-groups in which xr = x , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[43]  I. J. Good,et al.  Exact Markov Probabilities from Oriented Linear Graphs , 1957 .

[44]  G. A. Hedlund,et al.  Symbolic Dynamics II. Sturmian Trajectories , 1940 .

[45]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[46]  Michael O. Rabin,et al.  Recursive Unsolvability of Group Theoretic Problems , 1958 .

[47]  Joseph T. Clark,et al.  Aristotle's Syllogistic from the Standpoint of Modern Formal Logic. , 1952 .

[48]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[49]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[50]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[51]  B. M. Fulk.  MATH , 1992 .

[52]  Jan Łukasiewicz.  Aristotle's Syllogistic From the Standpoint of Modern Formal Logic , 1957 .

[53]  Peter J. Cameron,et al.  Some sequences of integers , 1989, Discret. Math..

[54]  C. Mauduit,et al.  Substitutions in dynamics, arithmetics, and combinatorics , 2002 .

[55]  Cunsheng Ding,et al.  Sequences and their Applications: Proceedings Of Seta '98 , 1999 .

[56]  W. T. Tutte.  Graph Theory , 1984 .

[57]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[58]  de Ng Dick Bruijn,et al.  Circuits and Trees in Oriented Linear Graphs , 1951 .

[59]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[60]  B. H. Neumann.  On the Number of Generators of a Free Product , 1943 .

[61]  James Kelsey Whittemore.  The Calculation of Logarithms , 2009 .

[62]  H. E. Robbins.  On a class of recurrent sequences , 1937 .

[63]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[64]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[65]  A. Zimin.  BLOCKING SETS OF TERMS , 1984 .

[66]  Jean Berstel.  Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. , 2004, SIGA.

[67]  J. Stillwell.  Mathematics and Its History , 2020, Undergraduate Texts in Mathematics.

[68]  Harold Fredricksen,et al.  Necklaces of beads in k colors and k-ary de Bruijn sequences , 1978, Discret. Math..

[69]  P. A. Macmahon.  Applications of a Theory of Permutations in Circular Procession to the Theory of Numbers , 1891 .

[70]  Iu I Khmelevskiĭ.  Equations in free semigroups , 1976 .

[71]  Dirk Siefkes,et al.  Finite Automata, Their Algebras and Grammars , 1990 .

[72]  P. M. Cohn,et al.  On subsemigroups of free semigroups , 1962 .

[73]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[74]  N. Gaffke,et al.  Note on a paper , 1991 .

[75]  R. Lyndon,et al.  Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series , 1958 .

[76]  M. L. Marx,et al.  The Gauss realizability problem , 1969 .

[77]  R. Lyndon.  On Burnside’s problem , 1954 .

[78]  A. T. Kolotov.  Free subalgebras of free associative algebras , 1978 .

[79]  H. Tietze,et al.  Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten , 1908 .

[80]  Dyck.  Gruppentheoretische Studien. (Mit drei lithographirten Tafeln.). , 2022 .

[81]  A. Church.  Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

[82]  W. V. Quine,et al.  Concatenation as a basis for arithmetic , 1946, Journal of Symbolic Logic.

[83]  Aldo de Luca,et al.  Finiteness and Regularity in Semigroups and Formal Languages , 1999, Monographs in Theoretical Computer Science An EATCS Series.

[84]  Harold Marston Morse.  Recurrent geodesics on a surface of negative curvature , 1921 .

[85]  Emil L. Post.  Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[86]  E. Witt,et al.  Treue Darstellung Liescher Ringe. , 1937 .

[87]  L. Lovász,et al.  A forbidden substructure characterization of Gauss codes , 1976 .

[88]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[89]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[90]  L. B. Treybig,et al.  A characterization of the double point structure of the projection of a polygonal knot in regular position , 1968 .

[91]  W. Magnus,et al.  Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations , 1966 .

[92]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[93]  T. Motzkin,et al.  A problem of arrangements , 1947 .

[94]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[95]  A. Markoff.  Sur une question de Jean Bernoulli , 1881 .

[96]  Pierre Rosenstiehl,et al.  A New Proof of the Gauss Interlace Conjecture , 1999 .

[97]  I. Good.  Normal Recurring Decimals , 1946 .

[98]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[99]  Charles C. Sims,et al.  Computation with finitely presented groups , 1994, Encyclopedia of mathematics and its applications.

[100]  Symbolic dynamics , 2008, Scholarpedia.

[101]  Donald E. Knuth,et al.  Oriented subtrees of an arc digraph , 1967 .

[102]  Jeffrey Shallit,et al.  The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[103]  A. Cayley.  A theorem on trees , 2009 .

[104]  Henri Poincaré,et al.  méthodes nouvelles de la mécanique céleste , 1892 .

[105]  B. Weiss.  Subshifts of finite type and sofic systems , 1973 .

[106]  Alfred Tarski,et al.  On undecidable statements in enlarged systems of logic and the concept of truth , 1939, Journal of Symbolic Logic.

[107]  É. Lucas,et al.  Théorie des nombres , 1961 .

[108]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[109]  O. Schreier,et al.  Die Untergruppen der freien Gruppen , 1927 .

[110]  A. Lentin.  Équations dans les monoïdes libres , 1972 .

[111]  P. Rosenstiehl.  Solution algébrique du problème de Gauss sur la permutation des points d'intersection d'une ou plusieurs courbes fermées du plan , 1976 .

[112]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[113]  Andrzej Ehrenfeucht,et al.  On Binary Equality Sets and a Solution to the Ehrenfeucht Conjecture in the Binary Case ; CU-CS-221-82 , 1983 .

[114]  Jean Berstel,et al.  Axel Thue's work on repetitions in words , 1992 .

[115]  Mark Sapir,et al.  PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS , 1988 .

[116]  W. T. Tutte,et al.  On Unicursal Paths in a Network of Degree 4 , 1941 .

[117]  Bartel Leendert,et al.  Wie der Beweis der Vermutung von Baudet gefunden wurde , 1998 .

[118]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[119]  Julius Richard Büchi,et al.  Finite automata, their algebras and grammars - towards a theory of formal expressions , 1989 .

[120]  E. Szemerédi.  On sets of integers containing k elements in arithmetic progression , 1975 .

[121]  Karel Culik,et al.  Classification of Noncounting Events , 1971, J. Comput. Syst. Sci..

[122]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[123]  Claudio Procesi,et al.  The Burnside problem , 1966 .

[124]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[125]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[126]  Zhi-Xiong Wen,et al.  LOCAL ISOMORPHISMS OF INVERTIBLE SUBSTITUTIONS , 1994 .