A note on the generation of rosary permutations
- 1 August 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (8) , 775
- https://doi.org/10.1145/361532.361560
Abstract
Harada [1] has given a method of generating rosary permutations, and of associating an integer with each such permutation in a one-to-one manner. In this note we show that both these ends can be achieved more easily than by Harada's method.Keywords
This publication has 2 references indexed in Scilit:
- Generation of Rosary permutations expressed in Hamiltonian circuitsCommunications of the ACM, 1971
- A number system for the permutationsCommunications of the ACM, 1970