A generalization of Canfield's formula

DOI10.1016/0097-3165(86)90114-7zbMath0601.05004OpenAlexW1980132473MaRDI QIDQ1080850

Edward A. Bender, L. Bruce Richmond

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90114-7

zbMATH Keywords

asymptotic enumerationadmissible function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (2)

Extended admissible functions and Gaussian limiting distributions ⋮ Steepest descent method and limiting distributions in combinatorial analysis

Cites Work

• Central and local limit theorems for the coefficients of polynomials of binomial type
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Multivariate stable distributions
• A Generalisation of Stirling's Formula.
• An Asymptotic Expansion for the Coefficients of Some Formal Power Series
• Asymptotic Relations Between Enumerative Functions in Graph Theory

This page was built for publication: A generalization of Canfield's formula