Enumerating a class of lattice paths
From MaRDI portal
Publication:1408864
DOI10.1016/S0012-365X(03)00037-2zbMath1027.05002MaRDI QIDQ1408864
Publication date: 25 September 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
Related Items
Parity reversing involutions on plane trees and 2-Motzkin paths, Old and young leaves on plane trees, Identities from weighted Motzkin paths, On the combinatorics of the Pfaff identity, Identities involving Narayana polynomials and Catalan numbers, A family of eigensequences, On the number of pseudo-triangulations of certain point sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rhyming schemes: crossings and coverings
- On the structure of the lattice of noncrossing partitions
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
- Analytic combinatorics of non-crossing configurations
- Linear trees and RNA secondary structure
- Two combinatorial statistics on Dyck paths
- Counting lattice paths by Narayana polynomials
- Deux propriétés combinatoires des nombres de Schröder
- Three recurrences for parallelogram polyominoes