A bijective census of nonseparable planar maps
Journal of Combinatorial Theory Series A
Left ternary trees and non-separable rooted planar maps
Theoretical Computer Science
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
The rotation correspondence is asymptotically a dilatation
Random Structures & Algorithms
Limit laws for embedded trees: Applications to the integrated superBrownian excursion
Random Structures & Algorithms
Embedded Trees and the Support of the ISE
Combinatorial Algorithms
| Hi-index | 0.00 |
Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of maps and embedded trees. The aim of this note is to apply their method, consisting of a suitable ansatz and (computer assisted) guessing, to three problems, all related to the enumeration of lattice paths. First, we derive the generating function of a family of embedded binary trees, unifying some earlier results in the literature. Second, we show that several enumeration problems concerning so-called simple families of lattice paths can be solved without using the kernel method. Third, we use their method to (re-)derive the length generating function of three vicious walkers and osculating walkers.