On the orderly listing of permutations
- UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
- Patricia Anne Griffin (Creator)
- Institution
- The University of North Carolina at Greensboro (UNCG )
- Web Site: http://library.uncg.edu/
- Advisor
- 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.
On the orderly listing of permutations
PDF (Portable Document Format)
3196 KB
Created on 1/1/1969
Views: 245
Additional Information
- Publication
- Thesis
- Language: English
- Date: 1969
- Subjects
- Permutations