Proper generating trees and their internal path length
From MaRDI portal
Publication:2476251
DOI10.1016/j.dam.2007.08.051zbMath1136.05002OpenAlexW2025238765MaRDI QIDQ2476251
Publication date: 18 March 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.051
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Related Items (3)
Some new binomial sums related to the Catalan triangle ⋮ A symbolic treatment of Riordan arrays ⋮ Generalized Schröder matrices arising from enumeration of lattice paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tennis ball problem
- Binary words excluding a pattern and proper Riordan arrays
- The Riordan group
- The number of Baxter permutations
- Pascal triangles, Catalan numbers and renewal arrays
- Underdiagonal lattice paths with unrestricted steps
- Riordan arrays and combinatorial sums
- Generating functions for generating trees
- Waiting patterns for a printer
- Some summation rules related to the Riordan arrays
- Bijections and the Riordan group
- Generating trees and the Catalan and Schröder numbers
- Generating trees and forbidden subsequences
- Generating trees and proper Riordan arrays
- Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type
- The Cauchy numbers
- On Some Alternative Characterizations of Riordan Arrays
- ECO:a methodology for the enumeration of combinatorial objects
This page was built for publication: Proper generating trees and their internal path length
