Gray code for permutations with a fixed number of cycles

DOI10.1016/J.DISC.2006.09.007zbMATH Open1128.90039OpenAlexW2129459759MaRDI QIDQ879329FDOQ879329

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

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

zbMATH Keywords

Gray codesrestricted permutationsgenerating algorithmstransposition array

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating permutations with given ups and downs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructions for permutation codes in powerline communications
• Title not available (Why is that?)
• Gray visiting Motzkins
• Gray code for derangements
• Gray codes for involutions
• A loopless algorithm for generating the permutations of a multiset
• A CAT algorithm for generating permutations with a fixed number of inversions
• Title not available (Why is that?)
• Loopless generation of up-down permutations

Cited In (27)

• Gray codes, loopless algorithm and partitions
• Some complementary Gray codes
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• A Gray code for permutations of size \(2d\) with \(d\) descents
• An efficient Gray code algorithm for generating all permutations with a given major index
• Tests and proofs for custom data generators
• Title not available (Why is that?)
• Gray code for permutations with a fixed number of left-to-right minima.
• Gray codes for signed involutions
• Note on Gray codes for permutation lists
• The pure descent statistic on permutations
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• A fractal set from the binary reflected Gray code
• Star transposition Gray codes for multiset permutations
• A Gray code for the shelling types of the boundary of a hypercube
• A loopless implementation of a gray code for signed permutations
• Doubly adjacent gray codes for the symmetric group
• Gray code for derangements
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Generating restricted classes of involutions, Bell and Stirling permutations
• More restrictive Gray codes for some classes of pattern avoiding permutations
• Strings from linear recurrences and permutations: a gray code
• Optimal Gray code for involutions
• Generating indecomposable permutations
• 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>
• Gray codes for involutions

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)