On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths
From MaRDI portal
Publication:1177984
DOI10.1007/BF02016301zbMath0746.05008MaRDI QIDQ1177984
Publication date: 26 June 1992
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68)
Related Items (2)
Applications of Gaussian binomials to coding theory for deletion error correction ⋮ Taylor expansions for Catalan and Motzkin numbers
Cites Work
- Unnamed Item
- A lattice walk approach to the inv and maj q-counting of multiset permutations
- Linear recurrences under side conditions
- A generalized q-multinomial Vandermonde convolution
- q-counting \(n\)-dimensional lattice paths
- A nonrecursive combinatorial rule for Eulerian numbers
- A note on q-Eulerian numbers
- A generalized q-binomial Vandermonde convolution
- On the number of certain lattice polygons
This page was built for publication: On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths