Asymptotic Methods in Enumeration

This is an expository paper dealing with those tools in asymptotic analysis which are especially useful in obtaining asymptotic results in enumeration problems. Emphasis is on tools which are general, are easily applied, and give estimates of the form an ∼ f(n). Many examples are given to illustrate...

Full description

Saved in:
Bibliographic Details
Published in:SIAM review 1974-10, Vol.16 (4), p.485-515
Main Author: Bender, Edward A.
Format: Article
Language:English
Subjects:
Coefficients
Combinatorics
Estimates
Generating function
Infinity
Mathematical functions
Power series
Radii of convergence
Recursion
Vertices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This is an expository paper dealing with those tools in asymptotic analysis which are especially useful in obtaining asymptotic results in enumeration problems. Emphasis is on tools which are general, are easily applied, and give estimates of the form an ∼ f(n). Many examples are given to illustrate the usage of the various tools. It is assumed that a summation or a generating function for an is explicitly or implicitly given.
ISSN:0036-1445
1095-7200
DOI:10.1137/1016082