Open AccessA loopless implementation of a gray code for signed permutations
Author(s) -
James F. Korsh,
Paul S. LaFollette,
Seymour Lipschutz
Publication year - 2011
Publication title -
publications de l institut mathematique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim1103037k
Subject(s) - gray code , gray (unit) , code (set theory) , computer science , combinatorics , mathematics , algorithm , set (abstract data type) , programming language , medicine , radiology
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 al oopless algorithm which generates a specific Gray code for Bn.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom