Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations

DOI10.1017/S0305004100062149zbMath0566.30023OpenAlexW2006086850WikidataQ105870438 ScholiaQ105870438MaRDI QIDQ3681092

Andrew M. Odlyzko, Philippe Flajolet

Publication date: 1984

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100062149

zbMATH Keywords

saddle point methodbinary trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05)

Related Items

On the left tail asymptotics for the limit law of supercritical Galton-Watson processes in the Böttcher case, Asymptotic properties of expansive Galton-Watson trees, Current trends in asymptotics: Some problems and some solutions, Concentration inequalities from monotone couplings for graphs, walks, trees and branching processes, Analytic methods in asymptotic enumeration, Steepest descent method and limiting distributions in combinatorial analysis, Functional iterations and stopping times for Brownian motion on the Sierpiński gasket, Integral Representation and Algorithms for Closed Form Summation, Generating binary trees of bounded height

Cites Work

• Unnamed Item
• Unnamed Item
• Periodic oscillations of coefficients of power series that satisfy functional equations
• The average height of binary trees and other simple trees
• Invariant sets under iteration of rational functions