A Fast Algorithm for Generating Permutation Distribution of Ranks in a K-Sample Experiment.

Abstract

An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented.The algorithm is based on combinatorics in finding the generating function of the distribution of the ranks. This further gives insight into the permutation distribution of a rank statistics. The algorithm is implemented with the aid of the computer algebra system Mathematica.

Key words: Combinatorics, generating function, permutation distribution, rank statistics, partitions, computer algebra.