Author/Authors :
Gessel، نويسنده , , Ira and Goddard، نويسنده , , Wayne and Shur، نويسنده , , Walter and Wilf، نويسنده , , Herbert S. and Yen، نويسنده , , Lily، نويسنده ,
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.
