Add to ORKGD.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
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...
AbstractWhen a list of size n is nearly sorted, a straight insertion sort algorithm is highly effici...
When a list of size n is nearly sorted, a straight insertion sort algorithm is highly efficient sinc...
When a list of size n is nearly sorted, a straight insertion sort algorithm is highly efficient sinc...
When a list of size n is nearly sorted, a straight insertion sort algorithm is highly efficient sinc...
AbstractWhen a list of size n is nearly sorted, a straight insertion sort algorithm is highly effici...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
Permutations consisting of a single cycle are considered. EDELMAN (1987) proved that such permutatio...
Permutations consisting of a single cycle are considered. EDELMAN (1987) proved that such permutatio...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
The simple relational structures form the units, or atoms, upon which all other relational structure...
AbstractIn the combinatorial study of the coefficients of a bivariate polynomial that generalizes bo...
The simple relational structures form the units, or atoms, upon which all other relational structure...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...
AbstractWhen a list of size n is nearly sorted, a straight insertion sort algorithm is highly effici...
When a list of size n is nearly sorted, a straight insertion sort algorithm is highly efficient sinc...
When a list of size n is nearly sorted, a straight insertion sort algorithm is highly efficient sinc...
When a list of size n is nearly sorted, a straight insertion sort algorithm is highly efficient sinc...
AbstractWhen a list of size n is nearly sorted, a straight insertion sort algorithm is highly effici...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
Permutations consisting of a single cycle are considered. EDELMAN (1987) proved that such permutatio...
Permutations consisting of a single cycle are considered. EDELMAN (1987) proved that such permutatio...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
The simple relational structures form the units, or atoms, upon which all other relational structure...
AbstractIn the combinatorial study of the coefficients of a bivariate polynomial that generalizes bo...
The simple relational structures form the units, or atoms, upon which all other relational structure...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
A thesis submitted to the Faculty d£ Science of the University of the Witwatersfand in fulfillment ...