Gray codes for reflection groups

DOI10.1007/BF01788686zbMath0684.20036MaRDI QIDQ1825283

Allan R. Wilks, N. J. A. Sloane, Conway, John H.

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian circuitGray codesCayley diagramfinite group generated by reflections

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Other geometric groups, including crystallographic groups (20H15) Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial codes (94B25)

Related Items

Analysis of a nonreversible Markov chain sampler., Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey, On the Hamiltonian cycle mapping onto 3-D torus interconnection network based on base-b reflected gray codes, The odd-even invariant and Hamiltonian circuits in tope graphs, Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions, Gray code enumeration of families of integer partitions, On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group, A survey on Hamiltonicity in Cayley graphs and digraphs on different groups, Hamilton cycles and paths in vertex-transitive graphs-current directions, Explicit definition of the binary reflected Gray codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gray-Codes
• Gray codes with restricted density
• Gray codes, fast Fourier transforms and hypercubes
• On \(m\)-ary Gray codes
• Gray codes in graphs of subsets
• A technique for generating Gray codes
• Non-repetitive sequences and Gray code
• Bounds on the number of Hamiltonian circuits in the n-cube
• A Gray code for set partitions
• The n-Dimensional Cube and the Tower of Hanoi
• Ringing the changes
• On Generating the N-ary Reflected Gray Codes
• Binary tree gray codes
• Ringing the Cosets
• A Technique for Generating Specialized Gray Codes
• Combinatorial Gray Codes
• A Gray code for compositions
• The separability of Gray code (Corresp.)
• Hamiltonian Circuits on the N-Cube
• An upper bound associated with errors in Gray code (Corresp.)
• A simplified loop-free algorithm for generating permutations
• On the Number of Hamiltonian Circuits in the n-Cube
• Efficient generation of the binary reflected gray code and its applications
• Signed Modified Reflected Binary Code
• A New Explanation of the Reflected Binary Code
• Hamiltonian Circuits and Paths on the n-Cube
• A Gray Code Counter
• Affine m-ary gray codes
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Double Adjacencies Between Cycles of a Circulating Shift Register
• Generation of Permutations by Adjacent Transposition
• Some Complete Cycles on the n-Cube