Title of article
Counting Pairs of Lattice Paths by Intersections
Author/Authors
Gessel، نويسنده , , Ira and Goddard، نويسنده , , Wayne and Shur، نويسنده , , Walter and Wilf، نويسنده , , Herbert S. and Yen، نويسنده , , Lily، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
15
From page
173
To page
187
Abstract
We count the pairs of walks between diagonally opposite corners of a given lattice rectangle by the number of points in which they intersect. We note that the number of such pairs with one intersection is twice the number with no intersection and we give a bijective proof of that fact. Some probabilistic variants of the problem are also investigated.
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series A
Record number
1530105
Link To Document