Counting paths in Young's lattice
β Scribed by Ira M. Gessel
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 556 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 probabil
We give bijective proofs, using weighted lattice paths, of two multinomial identities concerning the generalized h-factorial polynomials of order n. [x]~, := The first-one is the multinomial identity of order s verified by these polynomials. Using this identity (and its proof) as a lemma, we deriv