Gray code and loopless algorithm for the reflection group D_n

MaRDI QIDQ3077261zbMATH OpenFDO

Authors James F. Korsh, Seymour Lipschutz

Publication date 22 February 2011

zbMATH Keywords

algorithmsGray codereflection groupscombinatorial problemsloopless

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Paths and cycles (05C38) Geometric group theory (20F65) Other types of codes (94B60)

Recommendations

• Gray codes for reflection groups
• A loopless implementation of a gray code for signed permutations
• Note on Gray codes for permutation lists
• Doubly adjacent gray codes for the symmetric group
• A Survey of Combinatorial Gray Codes

Cited in

(5)

• Loop-free Gray code algorithms for the set of compositions
• Gray codes for reflection groups
• Gray codes, loopless algorithm and partitions
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Doubly adjacent gray codes for the symmetric group

This page was built for publication: Gray code and loopless algorithm for the reflection group \(D_n\)

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