• structures are studied. Combinatorics studies how to count these objects using various representations. Combinatorics on words is a recent development...
    20 KB (2,588 words) - 12:32, 13 February 2025
  • making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is graph...
    33 KB (3,558 words) - 07:48, 21 July 2025
  • Thumbnail for Necklace (combinatorics)
    In combinatorics, a k-ary necklace of length n is an equivalence class of n-character strings over an alphabet of size k, taking all rotations as equivalent...
    8 KB (1,111 words) - 04:02, 17 July 2025
  • Algebraic combinatorics Analytic combinatorics Arithmetic combinatorics Combinatorics on words Combinatorial design theory Enumerative combinatorics Extremal...
    9 KB (683 words) - 08:34, 14 July 2024
  • L} . In combinatorics on words, a common problem is to determine the number A ( n ) {\displaystyle A(n)} of length- n {\displaystyle n} words in a factorial...
    17 KB (2,949 words) - 03:33, 1 July 2025
  • Algorithmic Combinatorics on Partial Words is a book in the area of combinatorics on words, and more specifically on partial words. It was written by Francine...
    6 KB (668 words) - 15:49, 5 March 2025
  • Thumbnail for Formal language
    an interpretation of terms such that the formula becomes true. Combinatorics on words Formal method Free monoid Grammar framework Mathematical notation...
    27 KB (3,163 words) - 22:12, 19 July 2025
  • Thumbnail for Sturmian word
    Sturmian word (category Combinatorics on words)
    1016/0020-0190(95)00067-M. Lothaire, M. (2002). "Sturmian Words". Algebraic Combinatorics on Words. Cambridge: Cambridge University Press. ISBN 0-521-81220-8...
    14 KB (1,939 words) - 13:42, 10 January 2025
  • Reutenauer, Christophe; Saliola, Franco V. (2009). Combinatorics on words. Christoffel words and repetitions in words. CRM Monograph Series. Vol. 27. Providence...
    31 KB (3,872 words) - 13:41, 29 July 2025
  • Thumbnail for Superpermutation
    Superpermutation (category Combinatorics on words)
    In combinatorial mathematics, a superpermutation on n symbols is a string that contains each permutation of n symbols as a substring. While trivial superpermutations...
    11 KB (1,202 words) - 04:58, 8 June 2025
  • Free monoid (category Combinatorics on words)
    Press, ISBN 978-0-521-88831-8, Zbl 1187.94001 Lothaire, M. (1997), Combinatorics on words, Cambridge Mathematical Library, vol. 17, Contributors: Perrin,...
    22 KB (2,986 words) - 10:42, 16 July 2025
  • Local language (formal language) (category Combinatorics on words)
    k-testable language L is one for which membership of a word w in L depends only on the prefix and suffix of length k and the set of factors of w of length k;...
    3 KB (401 words) - 19:56, 23 May 2025
  • Graham–Rothschild theorem (category Combinatorics on words)
    Graham–Rothschild theorem is a theorem that applies Ramsey theory to combinatorics on words and combinatorial cubes. It is named after Ronald Graham and Bruce...
    9 KB (1,220 words) - 02:58, 12 April 2025
  • Necklace problem (category Combinatorics on words)
    Harary, Frank (eds.). Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University...
    4 KB (535 words) - 09:02, 12 July 2025
  • Lyndon word (redirect from Lyndon words)
    In mathematics, in the areas of combinatorics and computer science, a Lyndon word is a nonempty string that is strictly smaller in lexicographic order...
    21 KB (2,749 words) - 01:18, 7 August 2024
  • Square-free word (category Combinatorics on words)
    In combinatorics, a square-free word is a word (a sequence of symbols) that does not contain any squares. A square is a word of the form XX, where X is...
    16 KB (2,382 words) - 07:51, 17 April 2025
  • Thumbnail for String (computer science)
    String (computer science) (category Combinatorics on words)
    A string is often implemented as an array data structure of bytes (or words) that stores a sequence of elements, typically characters, using some character...
    41 KB (5,027 words) - 16:16, 11 May 2025
  • Thumbnail for Fibonacci word
    ISBN 978-90-481-6545-2, MR 2076798. Lothaire, M. (1997), Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, vol. 17 (2nd ed...
    14 KB (1,956 words) - 20:55, 31 July 2025
  • In combinatorics, a branch of mathematics, the autocorrelation of a word is the set of periods of this word. More precisely, it is a sequence of values...
    7 KB (1,228 words) - 22:13, 18 August 2023
  • Necklace polynomial (category Combinatorics on words)
    {lcm} (j,m)=nm}{\frac {j}{n}}M(\beta ,j).} Lothaire, M. (1997). Combinatorics on words. Encyclopedia of Mathematics and Its Applications. Vol. 17. Perrin...
    8 KB (1,465 words) - 04:26, 19 April 2025
  • Word equation (category Combinatorics on words)
    {\displaystyle h(u)=h(v)} . Word equations are a central object in combinatorics on words; they play an analogous role in this area as do Diophantine equations...
    30 KB (4,051 words) - 14:03, 27 June 2025
  • Lattice word (category Combinatorics on words)
    In mathematics, a lattice word (or lattice permutation) is a string composed of positive integers, in which every prefix contains at least as many positive...
    1 KB (133 words) - 13:22, 27 January 2025
  • arXiv:0908.0239, Bibcode:2009arXiv0908.0239K. *Lothaire, M. (1997), Combinatorics on words, Encyclopedia of Mathematics and Its Applications, vol. 17, Perrin...
    40 KB (3,574 words) - 06:20, 24 June 2025
  • Thumbnail for Fine and Wilf's theorem
    Fine and Wilf's theorem (category Combinatorics on words)
    In combinatorics on words, Fine and Wilf's theorem is a fundamental result describing what happens when a long-enough word has two different periods (i...
    14 KB (2,424 words) - 05:29, 15 July 2025
  • Thumbnail for Mehryar Mohri
    with the pseudonym M. Lothaire and contributed to the book on Applied Combinatorics on Words. He is the author of more than 250 conference and journal...
    4 KB (330 words) - 14:51, 2 July 2025
  • Unavoidable pattern (category Combinatorics on words)
    Algebraic Combinatorics on Words. Cambridge University Press. ISBN 9780521812207. Combinatorics on Words: Christoffel Words and Repetitions in Words. American...
    18 KB (2,903 words) - 00:33, 19 May 2025
  • Thumbnail for Dominique Perrin
    computer scientist known for his contributions to coding theory and to combinatorics on words. He is a professor of the University of Marne-la-Vallée and currently...
    5 KB (374 words) - 12:50, 16 October 2024
  • Dejean's theorem (category Combinatorics on words)
    repetitions in infinite strings of symbols. It belongs to the field of combinatorics on words; it was conjectured in 1972 by Françoise Dejean and proven in 2009...
    7 KB (938 words) - 02:19, 12 April 2025
  • y−1zxx−1yz−1 are words in the set {x, y, z}. Two different words may evaluate to the same value in G, or even in every group. Words play an important...
    8 KB (1,295 words) - 14:12, 13 June 2023
  • Thumbnail for Directed acyclic graph
    Directed acyclic graph (category Commons category link is on Wikidata)
    ISBN 978-3-540-63220-7, S2CID 17045308. Lothaire, M. (2005), Applied Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 105, Cambridge...
    45 KB (5,646 words) - 17:54, 7 June 2025