Factorization of permutations
From MaRDI portal
Publication:3448189
Abstract: We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, , such that every permutation can be factored into no more than special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics.
Recommendations
Cited in
(7)- Enumeration of Payphone Permutations
- Inequivalent factorizations of permutations
- Divide-and-permute
- Permutation polynomials and factorization
- Transposition as a permutation: a tale of group actions and modular arithmetic
- Finding composition factors of permutation groups of degree \(n\leq 10^ 6\)
- Sorting on graphs by adjacent swaps using permutation groups
This page was built for publication: Factorization of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448189)