Title:  Analytic Combinatorics

                   Nevin Napur
   Center for the Mathematics of Information
       California Institute of Technology

Abstract: Analytic Combinatorics is the study of generating functions
as analytic objects with the goal of predicting the asymptotics of the
underlying sequences.  When such methods are applicable they provide
highly precise estimates, usually in a mechanical fashion.  In this
talk I will provide background for and present examples of some of
these techniques as applicable to basic combinatorial structures such
as trees, permutations, partitions, graphs, etc.