Counting Rooted Trees: The Universal Law t(n) ~ C ρ^{-n} n^{-3/2}
| dc.creator | Bell, Jason P. | |
| dc.creator | Burris, Stanley N. | |
| dc.creator | Yeats, Karen A. | |
| dc.date | 2005-12-19 | |
| dc.date | 2006-08-09 | |
| dc.date.accessioned | 2026-07-07T06:55:30Z | |
| dc.date.available | 2026-07-07T06:55:30Z | |
| dc.description | Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence; for most of these a simple test can be used to quickly show that the form of the asymptotics is the same as that for the class of rooted trees: C ρ^{-n} n^{-3/2} where ρis the radius of convergence of T. | |
| dc.description | 53 pages, 5 figures, typos corrected, final version | |
| dc.identifier | https://arxiv.org/abs/math/0512432 | |
| dc.identifier | http://arxiv.org/abs/math/0512432 | |
| dc.identifier | The Electronic Journal of Combinatorics, 13 (2006), #R63 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106297 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C05 | |
| dc.title | Counting Rooted Trees: The Universal Law t(n) ~ C ρ^{-n} n^{-3/2} | |
| dc.type | text |