In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set...
4 KB (453 words) - 15:04, 22 August 2023
Permutohedron (redirect from Permutation polytope)
paths (sets of transpositions) that connect two vertices (permutations). Two permutations connected by an edge differ in only two places (one transposition)...
17 KB (1,400 words) - 08:59, 12 December 2024
Random binary tree (section From random permutations)
trees formed by inserting nodes one at a time according to a random permutation. The resulting trees are very likely to have logarithmic depth and logarithmic...
39 KB (5,297 words) - 04:35, 5 November 2024
upper bounds" (PDF). RAIRO – Theoretical Informatics and Applications – Informatique Théorique et Applications. 23 (2): 180. ISSN 0988-3754. Archived (PDF)...
66 KB (8,416 words) - 19:49, 22 December 2024
Schensted (1961) in his study of the longest increasing subsequence of a permutation. It was named the "monoïde plaxique" by Lascoux & Schützenberger (1981)...
9 KB (1,043 words) - 00:26, 24 April 2024
P. (1996), "On the Horton–Strahler number for random tries", RAIRO Informatique Théorique et Applications, 30 (5): 443–456, doi:10.1051/ita/1996300504431...
40 KB (4,788 words) - 13:05, 29 December 2023