q-Counting n-dimensional lattice paths
β Scribed by Robert A Sulanke
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 509 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0097-3165
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
## 3 IS ;1976) l37--I blisfrinfz Company Lattice paths with diagonal steps have Bern cons dered in [3--S, 'P-9] for the two dimensional-use and in [ 2,4,10] for tile three-dirllensional Case. It may be observed that the idea of weighted lattice paths as discussed hy Fray and ssek is in a sense not