On the orderly listing of permutations

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Patricia Anne Griffin (Creator)
The University of North Carolina at Greensboro (UNCG )
Web Site: http://library.uncg.edu/
Charles Church

Abstract: 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, or serial number, in the list without generating any others. In the following discussion several methods of obtaining an orderly listing are considered, especially with respect to the recovery of information regarding the number of inversions in a given permutation.

Additional Information

Language: English
Date: 1969

Email this document to