No abstract

No abstract

The number, , of rooted plane binary trees of height ≤ h with n internal nodes is shown to satisfyuniformly for δ−1(log n)−1/2 ≤ β ≤ δ(log n)1/2, where and δ is a positive constant. An asymptotic formula for is derived for h = cn, where 0 < c < 1. Bounds for are also derived for large and small heights. The methods apply to any simple family of trees, and the general asymptotic results are stated.

The constant $t_g$ appears in the asymptotic formulas for a variety of rooted maps on the orientable surface of genus $g$. Heretofore, studying this constant has been difficult. A new recursion derived by Goulden and Jackson for rooted cubic maps provides a much simpler recursion for $t_g$ that leads to estimates for its asymptotics.

No abstract