The Number System of the Permutations Generated by Cyclic Shift
From MaRDI portal
Abstract: A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code describing the symmetry properties of the set of permutations generated by cyclic shift. This code is conjectured to be a combinatorial Gray code listing the set of permutations: this corresponds to an Hamiltonian path of minimal weight in an appropriate regular digraph.
Recommendations
- scientific article; zbMATH DE number 1270967
- Cyclic permutations realized by signed shifts
- On the constructions of n-cycle permutations
- On the number of cycles in a random permutation
- scientific article; zbMATH DE number 6909276
- Cyclic permutations of sequences and uniform partitions
- Description and generation of permutations containing cycles
Cited in
(12)- On permutations of wires and states
- Shorthand universal cycles for permutations
- On cyclic Schur-positive sets of permutations
- Description and generation of permutations containing cycles
- Cyclic permutations realized by signed shifts
- Influence of certain transpositions on the cyclic structure of permutations
- scientific article; zbMATH DE number 6007658 (Why is no real title available?)
- scientific article; zbMATH DE number 6909276 (Why is no real title available?)
- scientific article; zbMATH DE number 4173894 (Why is no real title available?)
- Efficient enumeration of cyclic permutations in situ
- Solving the sigma-tau problem
- Permutations and \(\beta \)-shifts
This page was built for publication: The Number System of the Permutations Generated by Cyclic Shift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004877)