On the orderly listing of permutations |
1969 |
245 |
D.H. Lehmer states that by an orderly listing of permutations is meant a generation for which it is possible to obtain the k th permutation directly from the number k, and conversely, given a permutation, it is possible to determine at once its rank,... |