Gray codes for involutions

MaRDI QIDQ2721325zbMATH OpenFDO

Authors Timothy R. S. Walsh

Publication date 19 February 2002

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

Gray code

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics in computer science (68R05)

Recommendations

• Optimal Gray code for involutions
• Gray codes for signed involutions
• Gray code for permutations with a fixed number of cycles
• Gray code for permutations with a fixed number of left-to-right minima.
• scientific article; zbMATH DE number 2040940

Cited in

(14)

• Gray codes, loopless algorithm and partitions
• The coolest way to generate combinations
• Gray code for derangements
• A loopless algorithm for generating the permutations of a multiset
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• Optimal Gray code for involutions
• scientific article; zbMATH DE number 2040940 (Why is no real title available?)
• Gray codes for signed involutions
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
• Gray code for permutations with a fixed number of cycles
• 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
• A general exhaustive generation algorithm for Gray structures

This page was built for publication: Gray codes for involutions

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