Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-27T02:32:39.673Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  24 October 2008

P. Flajolet  and
A. M. Odlyzko
P. Flajolet
Affiliation:
INRIA, 78150 Rocquencourt, France
A. M. Odlyzko
Affiliation:
Bell Laboratories, Murray Hill, New Jersey 07974, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper studies coefficients yh, n of sequences of polynomials

defined by non-linear recurrences. A typical example to which the results of this paperapply is that of the sequence

which arises in the study of binary trees. For a wide class of similar sequences a general distribution law for the coefficients yh, n as functions of n with h fixed is established. It follows from this law that in many interesting cases the distribution is asymptotically Gaussian near the peak. The proof relies on the saddle point method applied in a region where the polynomials grow doubly exponentially as h → ∞. Applications of these results include enumerations of binary trees and 2–3 trees. Other structures of interest in computer science and combinatorics can also be studied by this method or its extensions.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 96 , Issue 2 , September 1984 , pp. 237 - 253
Copyright
Copyright © Cambridge Philosophical Society 1984

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Aho, A. V., Hopcroft, J. E. and Ullman, J. D.. The Design and Analysis of Computer Algorithms (Addison-Wesley, 1974).Google Scholar
[2]Aho, A. V. and Sloane, N. J. A.. Soem e doubly exponential sequences. Fibonacci Quart. 11 (1973), 429–437.Google Scholar
[3]Brolin, H.. Invariant sets under iteration of rational functions. Ark. Mat. 6 (1965), 103–144.Google Scholar
[4]Fatou, P.. Mémoire sur les équations fonctionnelles. Bull. Soc. Math. France 47 (1919), 161–271; 48 (1920), 33–94 and 208–314.Google Scholar
[5]Flajolet, P. and Odlyzko, A. M.. The average height of binary trees and other simple trees. J. Comput. System Sci. 25 (1982), 171–213.Google Scholar
[6]Harris, B. and Schoenfeld, L.. Asymptotic expansions for the coefficients of analytic functions. Illinois J. Math. 12 (1968), 264–277.CrossRefGoogle Scholar
[7]Hayman, W. K.. A generalization of Stirling’s formula. J. Reine Angew. Math. 196 (1956), 67–95.CrossRefGoogle Scholar
[8]Julia, G.. Mémoire sur l’itération desfonctions rationnelles. J. Math. Pures Appl. (8) 1 (1918), 47–245.Google Scholar
[9]Knuth, D. E.. The Art of Computer Programming, vol. 1; Fundamental Algorithms (Addison-Wesley, 1968).Google Scholar
[10]Odlyzko, A. M.. Periodic oscillations of coefficients of power series that satisfy functional equations. Adv. in Math. 44 (1982), 180–205.CrossRefGoogle Scholar
[11]Odlyzko, A. M.. Enumeration of AVL-trees, manuscript in preparation.Google Scholar
[12]Odlyzko, A. M. and Richmond, L. B.. On the unimodality of high convolutions of discrete distributions, to be published.Google Scholar
[13]Odlyzko, A. M. and Richmond, L. B.. Manuscript in preparation.Google Scholar
[14]Odlyzko, A. M. and Richmond, L. B.. Asymptotic expansions for the coefficients of analytic generating functions. Aequationes Math., to appear.Google Scholar
[15]Reingold, E. M.. A note on 3–2 trees. Fibonacci Quart. 17 (1979), 151–157.Google Scholar