SIAM Journal on Discrete Mathematics · 1990 · 858 citations · 17 references
Natural SciencesMathematicsCombinatoricsFinite Element AnalysisNumber TheoryAnalytic Number TheoryCombinatorial EnumerationCombinatorial Number TheoryEnumerative CombinatoricsGenerating FunctionsNumerical IntegrationAsymptotic EnumerationAsymptotic ExpansionsCoefficient AsymptoticsContour IntegrationDarboux TheoremProbability Generating FunctionsSingularity ProblemTauberian Theorems
This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic expansion for the Taylor coefficients of the function. This approach is based on contour integration using Cauchy’s formula and Hankel-like contours. It constitutes an alternative to either Darboux’s method or Tauberian theorems that appears to be well suited to combinatorial enumerations, and a few applications in this area are outlined.
17
Nature · 1916 · 2.7K citations
The Art of Computer Programming, Vol. 2
Donald E. Knuth · Medical Entomology and Zoology · 1981 · 863 citations
Asymptotic Methods in Enumeration
Edward A. Bender · SIAM Review · 1974 · 458 citations