Full asymptotic expansion for Polya structures
Abstract
In order to obtain the full asymptotic expansion for Polya trees, i.e. rooted unlabelled and non-plane trees, Flajolet and Sedgewick observed that their specification could be seen as a slight disturbance of the functional equation satisfied by the Cayley tree function. Such an approach highlights the complicated formal expressions with some combinatorial explanation. They initiated this process in their book but they spared the technical part by only exhibiting the first- order approximation. In this paper we exhibit the university of the method and obtain the full asymptotic expansions for several varieties of trees. We then focus on three different varieties of rooted, unlabelled and non-plane trees, Polya trees, rooted identity trees and hierarchies, in order to calculate explicitly their full singular expansions and asymptotic expansions.
Keywords
Cite
@article{arxiv.1605.00837,
title = {Full asymptotic expansion for Polya structures},
author = {Antoine Genitrini},
journal= {arXiv preprint arXiv:1605.00837},
year = {2016}
}
Comments
To appear in Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland, 4-8 July, 2016