Gray codes for reflection groups (Q1825283): Difference between revisions

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.