Generating functionology
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
Discrete Mathematics
Concrete Math
A bijection between ordered trees and 2-Motzkin paths and its many consequences
Discrete Mathematics
Hi-index | 0.00 |
We give a short combinatorial proof of a Fine number generating function identity and then explore some of the ramifications in terms of random walks, friendly walkers, and ordered trees. The results are also generalized to obtain similar results including those in Motzkin and Schroder settings.