Show simple item record

Combinatorics and Asymptotics on Trees

dc.creatorDrmota, Michael
dc.date2004-08-01
dc.date.accessioned2019-05-03T12:36:50Z
dc.date.available2019-05-03T12:36:50Z
dc.identifierhttp://revistas.ufro.cl/ojs/index.php/cubo/article/view/1642
dc.identifier.urihttp://revistaschilenas.uchile.cl/handle/2250/84367
dc.descriptionThe 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad de La Frontera. Temuco, Chile.en-US
dc.relationhttp://revistas.ufro.cl/ojs/index.php/cubo/article/view/1642/1493
dc.sourceCUBO, A Mathematical Journal; Vol. 6 Núm. 2 (2004): CUBO, A Mathematical Journal; 105–136es-ES
dc.sourceCUBO, A Mathematical Journal; Vol 6 No 2 (2004): CUBO, A Mathematical Journal; 105–136en-US
dc.source0719-0646
dc.source0716-7776
dc.titleCombinatorics and Asymptotics on Treesen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record