- On completion of the course, the student should know the basic tools of analytic combinatorics such as generating functions
- Combinatorial Structures and OGFsThe first lecture is about the symbolic method, where we define combinatorial constructions that we can use to define classes of combinatorial objects. The constructionsare integrated with transfer theorems that lead to equations that define generating functions whose coefficients enumerate the classes. We consider numerous examples from classical combinatorics.
- Labelled Structures and EGFsThis lecture introduces labelled objects, where the atoms that we use to build objects are distinguishable. We use exponential generating functions EGFs to study combinatorial classes built from labelled objects. We define combinatorial constructions that lead to EGF equations, and consider numerous examples from classical combinatorics
- Combinatorial Parameters and MGFs.This lecture describes the process of adding variables to mark parameters and then using the constructions form previous topics and natural extensions of the transfer theorems to define multivariate GFs that contain information about parameters. We concentrate on bivariate generating functions (BGFs), where one variable marks the size of an object and the other marks the value of a parameter. After studying ways of computing the mean, standard deviation and other moments from BGFs, we consider several examples in some detail
- Complex Analysis, Rational and Meromorphic Asymptotics.We introduce the idea of viewing generating functions as analytic objects, which leads us to asymptotic estimates of coefficients. The approach is most fruitful when we consider GFs as complex functions, so we introduce and apply basic concepts in complex analysis. We start from basic principles, so prior knowledge of complex analysis is not required.
- Applications of Rational and Meromorphic AsymptoticsWe consider applications of the general transfer theorem of the previous lecture to many of the classic combinatorial classes. Then we consider a universal law that gives asymptotics for a broad swath of combinatorial classes built with the sequence construction.
- Singularity AnalysisThis lecture addresses the basic Flajolet-Odlyzko theorem, where we find the domain of analyticity of the function near its dominant singularity, approximate using functions from standard scale, and then transfer to coefficient asymptotics term-by-term
- Applications of Singularity AnalysisWe see how the Flajolet-Odlyzko approach leads to universal laws covering combinatorial classes built with the set, multiset, and recursive sequence constructions. Then we consider applications to many of the classic combinatorial classes that we encountered in previous topics
- Saddle Point AsymptoticsWe consider the saddle point method, a general technique for contour integration that also provides an effective path to the development of coefficient asymptotics for GFs with no singularities. As usual, we consider the application of this method to several of the classic problems introduced in previous topics.
- Assessment obtained on the platform https://www.coursera.org/learn/analytic-combinatorics
- Interim assessment (3 module)0.5 * Assessment obtained on the platform https://www.coursera.org/learn/analytic-combinatorics + 0.5 * Exam
- Flajolet, Philippe. Analytic combinatorics / Philippe Flajolet, Robert Sedgewick. – Cambridge University Press, 2009
- Fayolle G, Malyshev V, Iasnogorodski R \\ Random Walks in the Quarter Plane: Algebraic Methods, Boundary Value Problems, Applications to Queueing Systems and Analytic Combinatorics \\ Springer \\ https://www.springer.com/us/book/9783319509280