Combinatorics and Asymptotics on Trees
-
Michael Drmota
drmota@tuwien.ac.at
Downloads
Abstract
The purpose of this article is to present explicit and asymptotic methods to count various kinds of trees. In all cases the use of generating functions is essential. Explicit formulae are derived with help of Lagrange's inversion formula. On the other hand singularity analysis of generating functions leads to aymptotic formulas.
Keywords
Similar Articles
- Aníbal Coronel, Fernando Huancas, Esperanza Lozada, Jorge Torres, Análisis matemático de un problema inverso para un sistema de reacción-difusión originado en epidemiología , CUBO, A Mathematical Journal: Vol. 27 No. 2 (2025): Spanish Edition (40th Anniversary)
- Sergio Amat, Sonia Busquier, David Levin, Juan C. Trillo, Esquemas de subdivisión no lineales: 25 años de historia a través de 75 contribuciones , CUBO, A Mathematical Journal: Vol. 27 No. 2 (2025): Spanish Edition (40th Anniversary)
- Terje Hill, David A. Robbins, Vector-valued algebras and variants of amenability , CUBO, A Mathematical Journal: Vol. 27 No. 3 (2025)
- Zahoor Ahmad Rather, Rais Ahmad, Inertial viscosity Mann-type subgradient extragradient algorithms for solving variational inequality and fixed point problems in real Hilbert spaces , CUBO, A Mathematical Journal: Vol. 28 No. 1 (2026)
- Fethi Soltani, Maher Aloui, Hausdorff operators associated with the linear canonical Sturm-Liouville transform , CUBO, A Mathematical Journal: Vol. 28 No. 1 (2026)
You may also start an advanced similarity search for this article.
Downloads
Download data is not yet available.
Published
2004-08-01
How to Cite
[1]
M. Drmota, “Combinatorics and Asymptotics on Trees”, CUBO, vol. 6, no. 2, pp. 105–136, Aug. 2004.
Issue
Section
Articles
