A LOOPLESS IMPLEMENTATION OF A GRAY CODE FOR SIGNED PERMUTATIONS

摘要

Conway, Sloane and Wilks [2] proved the existence of a Gray code for the reflection group $B_n$. The elements of this group are the signed permutations of the set ${1,2,dots,n}$. Here we give a loopless algorithm which generates a specific Gray code for $B_n$.