On integer partitions and the Wilcoxon rank-sum statistic

Abstract

In the literature, derivations of exact null distributions of rank-sum statistics is often avoided in cases where one or more ties exist in the data. By deriving the null distribution in the no-ties case with the aid of classical $q$-series results of Euler and Rothe, we demonstrate how a natural generalization of the method may be employed to derive exact null distributions even when one or more ties are present in the data. It is suggested that this method could be implemented in a computer algebra system, or even a more primitive computer language, so that the normal approximation need not be employed in the case of small sample sizes, when it is less likely to be very accurate. Several algorithms for determining exact distributions of the rank-sum statistic (possibly with ties) have been given in the literature (see Streitberg and R\"ohmel (1986) and Marx et al. (2016)), but none seem as simple as the procedure discussed here which amounts to multiplying out a certain polynomial, extracting coefficients, and finally dividing by a binomal coefficient.