×

zbMATH — the first resource for mathematics

Asymptotic enumeration methods. (English) Zbl 0845.05005
Graham, R. L. (ed.) et al., Handbook of combinatorics. Vol. 1-2. Amsterdam: Elsevier (North-Holland). 1063-1229 (1995).
This magnificent article from the “Handbook of combinatorics” is a must for all mathematicians and computer scientists who are interested in the asymptotic aspects of enumerative sequences. The author, who is one of the leading experts in the field, gives a detailed overview on the analytical toolkit as well as a huge variety of examples. Amongst the themes in consideration there are direct asymptotic methods like Euler-Mclaurin and Poisson summation, as well as methods based on generating functions like singularity analysis (transfer theorems, Darboux’s method, saddle point method, circle method) or Mellin transforms. A final section on the very recent developments in algorithmic and automated asymptotics (initialized by P. Flajolet and his group at INRIA) and a long list of references finish this impressive overview of an area on the borderline of analysis and discrete mathematics.
For the entire collection see [Zbl 0833.05001].

MSC:
05A16 Asymptotic enumeration
05A15 Exact enumeration problems, generating functions
05A10 Factorials, binomial coefficients, combinatorial functions
30B10 Power series (including lacunary series) in one complex variable
68Q25 Analysis of algorithms and problem complexity
68R05 Combinatorics in computer science
PDF BibTeX XML Cite