Generation of the symmetric group S_n^2
From MaRDI portal
Publication:5063287
Recommendations
Cites work
- A chronicle of permutation statistical methods. 1920--2000, and beyond
- A new upper bound for sorting permutations with prefix transpositions
- Asymptotics of generating the symmetric and alternating groups.
- Codes from multipartite graphs and minimal permutation decoding sets
- Combinatorics of permutations
- Efficient sampling of random permutations
- Exact upper bound for sorting \(R_n\) with LE
- Generating a random permutation with random transpositions
- Generating random permutations by coin tossing: classical algorithms, new analysis, and modern implementation
- scientific article; zbMATH DE number 6006600 (Why is no real title available?)
- scientific article; zbMATH DE number 5150116 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 1942428 (Why is no real title available?)
- scientific article; zbMATH DE number 1918700 (Why is no real title available?)
- Mixing time of the card-cyclic-to-random shuffle
- Random permutations using switching networks
- Symmetric generation of Coxeter groups.
Cited in
(7)- Symmetric and permutational generating set of the groups \(A_{kn+1}\) and \(S_{kn+1}\) using \(S_n\) and an element of order \(k\)
- On the maximal number of elements pairwise generating the symmetric group of even degree
- The Answer is 2 n . n! What's the Question?
- scientific article; zbMATH DE number 5904520 (Why is no real title available?)
- scientific article; zbMATH DE number 5773278 (Why is no real title available?)
- scientific article; zbMATH DE number 1821763 (Why is no real title available?)
- Transposition as a permutation: a tale of group actions and modular arithmetic
This page was built for publication: Generation of the symmetric group \(S_{n^2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063287)