Publications de l'Institut Mathématique, Nouvelle SérieVol. 89(103), pp. 37–47 (2011)
|
|
Publications de l'Institut Mathématique, Nouvelle Série Vol. 89(103), pp. 37–47 (2011) |
|
|
A LOOPLESS IMPLEMENTATION OF A GRAY CODE FOR SIGNED PERMUTATIONSJames Korsh, Paul LaFollette, and Seymour LipschutzDepartment of CIS/Mathematics, Temple University, Philadelphia, PA 19122, U.S.A.Abstract: 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$. Keywords: algorithms; combinatorial; loopless; gray code; reflection groups; signed permutations Classification (MSC2000): 68R05; 05A05 Full text of the article: (for faster download, first choose a mirror)
Electronic fulltext finalized on: 6 Apr 2011. This page was last modified: 16 Oct 2012.
© 2011 Mathematical Institute of the Serbian Academy of Science and Arts
|