Lattice path combinatorics with statistical applications

Title
Contents
Tables
Preface
I. Lattice path problems and vectors of integers
1. Representation of subsets of {1, ..., N}
2. A refinement of the Chung-Feller theorem
3. Lattice paths and the ballot theorem
4. Repeated reflections and applications
Exercises
References
II. The dominance theorem and Smirnov test-statistics
1. A theorem on domination and its geometrical interpretation
2. Discussion of the dominance theorem and some special cases
3. Duality and application to Smirnov statistics
Exercises
References
III. Some applications of dominance to statistical problems
1. The role of dominance in combinatorial problems
2. Dominance tests for Lehmann alternatives
Exercises
References
IV. The combinatorics of knock-out tournaments
1. The classical case
2. Random knock-out tournaments
3. A comparison of tournaments
Exercises
References
V. A miscellany of further research problems
1. A comparison of selection procedures
2. The numbers (n choose r) (n choose r-1) / n
3. Weak inadmissibility of tests
Exercise
References
Appendix: On some convolution identities from lattice path combinatorics
1.
2.
3.
4.
References
Notes and solutions
Chapter I
Chapter II
Chapter III
Chapter IV
Chapter V
Supplementary bibliography
Index