zbMATH — the first resource for mathematics

Adjacent transformations in permutations. (English. French summary) Zbl 1355.05028
Proceedings of the 23rd international conference on formal power series and algebraic combinatorics, FPSAC 2011, Reykjavik, Iceland, June 13–17, 2011. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 765-776 (2011).
Summary: We continue a study of the equivalence class induced on \(S_n\) when one is permitted to replace a consecutive set of elements in a permutation with the same elements in a different order. For each possible set of allowed replacements, we characterise and/or enumerate the set of permutations reachable from the identity. In some cases we also count the number of equivalence classes.
For the entire collection see [Zbl 1239.05002].

05A15 Exact enumeration problems, generating functions
05A05 Permutations, words, matrices
Full Text: Link