“…It is supposed that tied samples (i.e., x,=x,, i^j) are solved by uniform randomization [23]. Partition (15) is well defined by the rank vector r=(ri,r 2 r") where r is a permutation of (1, 2 n), and can be computed from sample vector x=(x!, x 2 x") after ordering (sorting) its components, i.e., x fl <x J2 < • • • <x in , so we have r ik = k, fe = l,2,...,n. Note that each value of the rank vector r defines a unique region D, -, i=l, 2 n!, shown in (15); for example, r=(l, 2 n) corresponds to the region Xi <x 2 < ... <x", and r=(2,1 n) corresponds to x 2 < Xi < ... < x", etc.…”