ASYMPTOTIC METHODS IN ENUMERATION

This is an expository paper, aimed at the combinatorialist, and 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 a//n is approximately 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 a//n is explicitly or implicitly given.