Gray codes for reflection groups
type: Item
instance of: scholarly article
title: Gray codes for reflection groups
zbMATH Open document ID: 0684.20036
DOI: 10.1007/BF01788686
author: N. J. A. Sloane
author: Allan R. Wilks
author: J. H. Conway
published in: Graphs and Combinatorics
publication date: 1989-01-01T00:00:00Z
review text: It is shown that in a finite group generated by reflections \(R_ 1,...,R_ n\) the elements can be arranged in order \(a_ 0,a_ 1,...,a_{g-1}\) so that for each i there is a j such that \(a_{i+1}=a_ iR_ j\) (where \(a_ g=a_ 0)\). Such an arrangement is called a Gray code, the classical example being the conventional binary Gray code, which is a Hamiltonian circuit through the n-cube. Specific Gray codes are computed for a number of examples.
Mathematics Subject Classification ID: 20H15
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 20D60
Mathematics Subject Classification ID: 20F05
zbMATH DE Number: 4120408
zbMATH Keywords: Cayley diagram
zbMATH Keywords: finite group generated by reflections
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: Gray codes
reviewed by: Ferdinand D. Veldkamp
MaRDI profile type: Publication
cites work: Hamiltonian Circuits and Paths on the n-Cube
cites work: Signed Modified Reflected Binary Code
cites work: Q3944542
cites work: Efficient generation of the binary reflected gray code and its applications
cites work: Q5580319
cites work: Gray codes with restricted density
cites work: An upper bound associated with errors in Gray code (Corresp.)
cites work: Gray codes, fast Fourier transforms and hypercubes
cites work: Affine m-ary gray codes
cites work: A Gray Code Counter
cites work: Q4039784
cites work: Q5672665
cites work: Q3855356
cites work: The n-Dimensional Cube and the Tower of Hanoi
cites work: A simplified loop-free algorithm for generating permutations
cites work: On the Number of Hamiltonian Circuits in the n-Cube
cites work: Bounds on the number of Hamiltonian circuits in the n-cube
cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
cites work: On Generating the N-ary Reflected Gray Codes
cites work: Q5736169
cites work: Q3701635
cites work: Generation of Permutations by Adjacent Transposition
cites work: Gray codes in graphs of subsets
cites work: Combinatorial Gray Codes
cites work: A Gray code for set partitions
cites work: A Gray code for compositions
cites work: Double Adjacencies Between Cycles of a Circulating Shift Register
cites work: A technique for generating Gray codes
cites work: Gray-Codes
cites work: Q4146667
cites work: Some Complete Cycles on the n-Cube
cites work: A New Explanation of the Reflected Binary Code
cites work: Non-repetitive sequences and Gray code
cites work: Binary tree gray codes
cites work: Q5786055
cites work: On \(m\)-ary Gray codes
cites work: Hamiltonian Circuits on the N-Cube
cites work: Distance-2 Cyclic Chaining of Constant-Weight Codes
cites work: A Technique for Generating Specialized Gray Codes
cites work: Q5684700
cites work: Q4156452
cites work: Ringing the changes
cites work: Q3752398
cites work: Ringing the Cosets
cites work: The separability of Gray code (Corresp.)
description: scientific article; zbMATH DE number 4120408