Lattice Paths with Diagonal Steps
Canadian mathematical bulletin, Tome 12 (1969) no. 6, pp. 847-855
Voir la notice de l'article provenant de la source Cambridge
The André-Poincaré "probléme du scrutin" [9] can be stated as follows: In an election between two candidates A polls m votes, B polls n, m > n. If the votes are counted one by one what is the probability that A leads B throughout the counting? Many derivations and interpretations of the solution have been given and a convenient summary of methods till 1956 can be found in Feller [1]. So numerous are the generalizations of ballot problems and their applications since this date that we do not even attempt an enumeration here.
Goodman, E.; Narayana, T.V. Lattice Paths with Diagonal Steps. Canadian mathematical bulletin, Tome 12 (1969) no. 6, pp. 847-855. doi: 10.4153/CMB-1969-110-x
@article{10_4153_CMB_1969_110_x,
author = {Goodman, E. and Narayana, T.V.},
title = {Lattice {Paths} with {Diagonal} {Steps}},
journal = {Canadian mathematical bulletin},
pages = {847--855},
year = {1969},
volume = {12},
number = {6},
doi = {10.4153/CMB-1969-110-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-110-x/}
}
Cité par Sources :