Asymptotic expansions for the coefficients of analytic generating functions
From MaRDI portal
Publication:762175
DOI10.1007/BF02189391zbMath0557.05040OpenAlexW2081982513MaRDI QIDQ762175
L. Bruce Richmond, Andrew M. Odlyzko
Publication date: 1985
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137038
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Combinatorial inequalities (05A20)
Related Items
Some asymptotic results useful in enumeration problems, Local limit approximations for Lagrangian distributions, Current trends in asymptotics: Some problems and some solutions, Limiting distributions for the number of distinct component sizes in relational structures, The asymptotics of ๐^{๐(๐ง)} and the number of elements of each order in ๐_{๐}, Khinchin families, set constructions, partitions and exponentials, A curious identity arising from Stirling's formula and saddle-point method on two different contours, Automatic average-case analysis of algorithms, On the maximal multiplicity of parts in a random integer partition, Analytic analysis of algorithms, Primary decomposition of lattice basis ideals, Symbolic asymptotics: Multiseries of inverse functions, Analytic variations on quadtrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic expansions for the coefficients of analytic functions
- A Generalisation of Stirling's Formula.
- Asymptotic Methods in Enumeration
- An Asymptotic Expansion for the Coefficients of Some Formal Power Series
- Asymptotic Relations Between Enumerative Functions in Graph Theory