TY  - BOOK
AU  - Ramonal,Danna Joy S.
TI  - Lexicographic ordering of an n-element set
PY  - 2002///
KW  - Undergraduate Thesis
KW  - AMAT200,
KW  - BSAM
N1  - Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002
N2  - Consider all the possible permutations of an n-element set {1,2,..,n} taken k at a time. Suppose these permutations arranged in lexicographic order. How do you determine the rank or position of a given permutation in the list? How do you find the particular permutation given its rank or position? This paper gives a formula for determining the rank or position of a permutation in the list and a formula for obtaining the particular permutation of a given rank or position, for n ranging from 1 to 9, without actually listing all the permutations involved. The lists of permutations is lexicographic order were observed for similar patterns that led to generate the formula. Would it be possible to generate a formula in finding the rank or position of the permutation and the permutation of the position if a certain number in the set of n elements is chosen and allow it to repeat n times? Would it also be possible to generate a formula in finding the rank or position of the permutation and the permutation of the position if a certain number in the set of n elements is chosen to have a fixed repetition?
ER  -