![]() |
Discrete Mathematics & Theoretical Computer Science |
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.
Source : ScholeXplorer
IsRelatedTo ARXIV 2008.02380 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.2008.02380
|