论文信息 - Proof of a conjecture of Narayana on dominance refinements of the Smirnov two-sample tests

Proof of a conjecture of Narayana on dominance refinements of the Smirnov two-sample tests

We prove the following conjecture of Narayana: there are no dominance refinements of the Smirnov two-sample test if and only if the two sample sizes are relatively prime. Keywords: Smirnov two-sample test, dominance refinement, Gnedenko path, dominance.

D. Loeb | A. D. Bucchianico

[1] T. V. Narayana,et al. Lattice Path Combinatorics With Statistical Applications , 1979 .

[2] J. E. Walsh,et al. Contributions to the Theory of Rank Order Statistics--The Two Sample Case , 1958 .

[3] I. Richard Savage,et al. CONTRIBUTIONS TO THE THEORY OF RANK ORDER STATISTICS THE TWO SAMPLE CASE: FINE STRUCTURE OF THE ORDERING OF PROBABILITIES OF RANK ORDERS , 1956 .

[4] H. M. Stark,et al. An introduction to number theory , 1978 .