Abstract
Conway, Sloane and Wilks [1989] proved the existence of a Gray code for the reflection group Bn. The elements of this group are the signed permutations of the set 1, 2, . . . ,n. Here we give a loopless algorithm which generates a specific Gray code for Bn.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
