A loopless implementation of a gray code for signed permutations

DOI10.2298/PIM1103037KMaRDI QIDQ4899855zbMATH OpenOpenAlexFDO

Authors James F. Korsh, Paul S. jun. LaFollette, Seymour Lipschutz

Publication date 10 January 2013

Published in Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/pim1103037k

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

finite reflection groups

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Other types of codes (94B60)

Recommendations

• Algorithms – ESA 2005
• Gray codes for signed involutions
• Gray codes, loopless algorithm and partitions
• Gray code for permutations with a fixed number of cycles
• Loop-free Gray code algorithms for the set of compositions
• Gray code for Cayley permutations
• Note on Gray codes for permutation lists
• An efficient Gray code algorithm for generating all permutations with a given major index
• Loopless generation of Gray codes for \(k\)-ary trees
• Combinatorial Gray codes for classes of pattern avoiding permutations

Cited in

(9)

• Loop-free Gray code algorithms for the set of compositions
• Gray code and loopless algorithm for the reflection group D_n
• Gray codes for reflection groups
• Algorithms – ESA 2005
• Gray codes, loopless algorithm and partitions
• Loopless Gray code enumeration and the Tower of Bucharest
• Gray codes for signed involutions
• Note on Gray codes for permutation lists
• Generating signed permutations by twisting two-sided ribbons

This page was built for publication: A loopless implementation of a gray code for signed permutations

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