(Enter summary)
Abstract: Pairs F(x), G(x) of analytic generating functions that satisfy relations such as 1 +G(x) = exp(F(x))
are studied. It is shown that if F(x) satisfies fairly mild regularity conditions, such as those imposed by
Hayman in his study of coefficients of some general classes of functions, then G(x) satisfies the much
stricter conditions imposed by Harris and Schoenfeld. This enables one to obtain complete asymptotic
expansions for the coefficients of G(x). Applications of this result are made to... (Update)
Context of citations to this paper: More
...(2. 5) However, when P(z , y) is not a polynomial, one can often obtain asymptotic estimates by using more classical estimates [18,19,29]. 3. Average heights of trees In the preceding section we presented some results on the enumeration of trees of a given height, so...
.... function we are studying is entire (has no singularities) or is exponentially growing near its singularity, we can use saddle point methods [Hay56, HS68, OR85]. A somewhat different technique from those we have considered till now is based in Mellin transform. Given a real...
Cited by: More
The Asymptotic Behaviour of Coefficients of Large Powers of .. - Danièle Gardy
(Correct)
Analytic Analysis of Algorithms - Flajolet (1992)
(Correct)
Statistics on Random Trees - Casas, Díaz, Martinez (1991)
(Correct)
Active bibliography (related documents): More All
0.6: Five Lectures on Generalized Permutation Representations - Müller
(Correct)
0.6: Representations In Finite Wreath Products: Enumerative theory and .. - Müller (1999)
(Correct)
0.5: Some New Methods and Results in Tree Enumeration - Odlyzko (1984)
(Correct)
Similar documents based on text: More All
0.2: Extended Admissible Functions And Gaussian Limiting.. - Drmota, Gittenberger..
(Correct)
0.2: Asymptotics Of Multivariate Sequences, Part I: Smooth Points .. - Pemantle, Wilson
(Correct)
0.2: On the Number of Distinct Block Sizes in Partitions of a Set - Odlyzko, Richmond (1985)
(Correct)
Related documents from co-citation: More All
7: The art of computer programming (context) - Knuth - 1973
7: Asymptotic expansions for the coefficients of analytic functions (context) - Harris, Schoenfeld - 1968
5: Singularity Analysis of Generating Functions (context) - Flajolet, Odlyzko - 1990
BibTeX entry: (Update)
Odlyzko, A. M., and Richmond, L. B. Asymptotic expansions for the coefficients of analytic generating functions. Aequationes Mathematicae 28 (1985), 50--63. http://citeseer.ist.psu.edu/odlyzko85asymptotic.html More
@article{ odlyzko85asymptotic,
author = "A. M. Odlyzko and L. B. Richmond",
title = "Asymptotic Expansions for the Coefficients of Analytic Generating Functions",
journal = "Aequationes Mathematicae",
volume = "28",
pages = "50--63",
year = "1985",
url = "citeseer.ist.psu.edu/odlyzko85asymptotic.html" }
Citations (may not include all citations):
116
Graphical Enumeration (context) - Harary, Palmer - 1973
61
Asymptotic Methods in Analysis (context) - deBruijn - 1958
48
Asymptotic methods in enumeration (context) - Bender - 1974
16
Topics in Analytic Number Theory (context) - Rademacher - 1973
13
Asymptotic expansions for the coefficients of analytic funct.. (context) - Harris, Schoenfeld - 1968
13
A generalization of Stirling's formula (context) - Hayman - 1956
12
Enumerative uses of generating functions (context) - Bender, Goldman - 1971
6
An asymptotic expansion for the coefficients of some formal .. (context) - Bender - 1975
6
An asymptotic expansion for the coefficients of some formal .. (context) - Bender, Richmond
5
Asymptotic relation between enumerative functions in graph t.. (context) - Wright - 1970
3
Limit distributions for coefficients of iterates of polynomi..
- Flajolet, Odlyzko
1
the generation and enumeration of homeomorphically irreducib.. (context) - Read - 1982
1
of idempotent elements in the symmetric semigroup on n eleme.. (context) - Harris, Schoenfeld et al. - 1966
1
Asymptotic estimation of the number of trees (context) - Yamashita - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~amo/doc/complete.html): More
The Rise and Fall of Knapsack Cryptosystems - Odlyzko (1990)
(Correct)
Computing pi(x): The Meissel-Lehmer Method - Lagarias, Miller, Odlyzko
(Correct)
Smart and stupid networks: Why the Internet is like Microsoft - Odlyzko (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC