A loopless implementation of a gray code for signed permutations

A loopless implementation of a gray code for signed permutations

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. nema

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Publications de l'Institut mathématique (Belgrade) 2011, Vol.89 (103), p.37-47
Hauptverfasser: Korsh, James, Lafollette, Paul, Lipschutz, Seymour
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. nema
ISSN:0350-1302
1820-7405
DOI:10.2298/PIM1103037K