论文信息 - A probabilistic method for lattice path enumeration - 字舞流文

A probabilistic method for lattice path enumeration

Abstract A probabilistic method for obtaining functional equations for lattice path enumeration problems is studied.

Ira M. Gessel | I. Gessel

[1] S. G. Mohanty,et al. Lattice Path Counting and Applications. , 1980 .

[2] Heinrich Niederhausen. The Ballot Problem with Three Candidates , 1983, Eur. J. Comb..

[3] Germain Kreweras,et al. Sur une classe de problèmes de dénombrement liés au treillis des partitions des entiers , 1965 .

[4] Random Walk and Distributions of Rank Order Statistics , 1972 .

[5] Daniel I. A. Cohen,et al. Recurrence of a random walk on the half-line as the generating function for the Catalan numbers , 1980, Discret. Math..

[6] Meyer Dwass. SIMPLE RANDOM WALK AND RANK ORDER STATISTICS , 1967 .

[7] Germain Kreweras,et al. Solution of an Enumerative Problem Connected with Lattice Paths , 1981, Eur. J. Comb..

[8] D. Knuth,et al. Mathematics for the Analysis of Algorithms , 1999 .