Gray code for permutations with a fixed number of cycles

DOI10.1016/J.DISC.2006.09.007MaRDI QIDQ879329zbMATH OpenOpenAlexFDO

Authors Jean-Luc Baril

Publication date 11 May 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.09.007

zbMATH Keywords

Gray codesrestricted permutationsgenerating algorithmstransposition array

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Recommendations

• Gray code for permutations with a fixed number of left-to-right minima.
• Gray code for derangements
• A Gray code for permutations of size \(2d\) with \(d\) descents
• Note on Gray codes for permutation lists
• More restrictive Gray codes for some classes of pattern avoiding permutations

Cites work

• scientific article; zbMATH DE number 434868 (Why is no real title available?)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 1354135 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2040940 (Why is no real title available?)
• A CAT algorithm for generating permutations with a fixed number of inversions
• A loopless algorithm for generating the permutations of a multiset
• Constructions for permutation codes in powerline communications
• Generating permutations with given ups and downs
• Gray code for derangements
• Gray codes for involutions
• Gray visiting Motzkins
• Loopless generation of up-down permutations

Cited in

(27)

• Star transposition Gray codes for multiset permutations
• Gray codes, loopless algorithm and partitions
• A Gray code for the shelling types of the boundary of a hypercube
• Generating restricted classes of involutions, Bell and Stirling permutations
• More restrictive Gray codes for some classes of pattern avoiding permutations
• The pure descent statistic on permutations
• Some complementary Gray codes
• Generating indecomposable permutations
• scientific article; zbMATH DE number 7662495 (Why is no real title available?)
• Strings from linear recurrences and permutations: a gray code
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• A Gray code for permutations of size \(2d\) with \(d\) descents
• A fractal set from the binary reflected Gray code
• Optimal Gray code for involutions
• Tests and proofs for custom data generators
• Gray code for permutations with a fixed number of left-to-right minima.
• Gray code for Cayley permutations
• Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>
• An efficient Gray code algorithm for generating all permutations with a given major index
• Doubly adjacent gray codes for the symmetric group
• Gray codes for signed involutions
• Combinatorial Gray codes for classes of pattern avoiding permutations
• A loopless implementation of a gray code for signed permutations
• Gray codes for involutions
• Gray code for derangements
• Note on Gray codes for permutation lists

This page was built for publication: Gray code for permutations with a fixed number of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879329)