Generating functions of embedded trees and lattice paths
From MaRDI portal
Abstract: Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems. First, we discuss a general family of embedded binary trees, trying to unify and summarize several enumeration results for binary tree families, and also to add new results. Second, we discuss the family of embedded -ary trees, embedded in the plane in a natural way. Third, we show that several enumeration problems concerning simple families of lattice paths can be solved without using the kernel method by regarding simple families of lattice paths as degenerated families of embedded trees.
Recommendations
- Basic analytic combinatorics of directed lattice paths
- On three and four vicious walkers
- Generating functions for lattice paths with several forbidden patterns
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Counting quadrant walks via Tutte's invariant method (extended abstract)
Cited in
(4)
This page was built for publication: Generating functions of embedded trees and lattice paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898456)
