2013
Coursera / Princeton University
Robert Sedgewick
~11 h
English
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. Part II introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for deriving accurate asymptotics from the GF equations.
Analytic Combinatorics is based on formal methods for deriving functional relationships on generating functions and asymptotic analysis treating those functions as functions in the complex plane. Part II covers the symbolic method for defining generating functions immediately from combinatorial constructions, then develops methods for directly deriving asymptotic results from those generating functions, using complex asymptotics, singularity analysis, saddle-point asymptotics, and limit laws. The course teaches the precept "if you can specify it, you can analyze it".
Lecture 1 Combinatorial Structures and OGFs
Lecture 2 Labelled Structures and EGFs
Lecture 3 Combinatorial Parameters and MGFs
Lecture 4 Complex Analysis, Rational and Meromorphic Asymptotics
Lecture 5 Applications of Rational and Meromorphic Asymptotics
Lecture 6 Singularity Analysis of Generating Functions
Lecture 7 Applications of Singularity Analysis
Lecture 8 Saddle-Point Asymptotics
www.coursera.org

Download File Size:1.43 GB

---