Gray code for permutations with a fixed number of cycles

DOI10.1016/j.disc.2006.09.007zbMath1128.90039OpenAlexW2129459759MaRDI QIDQ879329

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)

Related Items (10)

Tests and proofs for custom data generators ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Unnamed Item ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ The pure descent statistic on permutations ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Gray codes for signed involutions ⋮ Gray codes, loopless algorithm and partitions

Cites Work

• A CAT algorithm for generating permutations with a fixed number of inversions
• Generating permutations with given ups and downs
• Gray visiting Motzkins
• Gray code for derangements
• Constructions for permutation codes in powerline communications
• A loopless algorithm for generating the permutations of a multiset
• Loopless generation of up-down permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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