Origin:During Feb-May 2026, I had the pleasure of teaching the Math Special Topics Course "Combinatorics, Probability and Algorithms" at ANU. While the course touched on many facets of the three areas in its title, we did not have sufficient time to do justice to Analytic Combinatorics — a subject that reveals the elegant connection between the asymptotic behaviors of combinatorial structures and the complex analysis of generating functions. I have compiled this lecture series to provide a comprehensive introduction, and I hope this can help you appreciate the beauty of the subject as much as I do.
Prerequisite: Mathematical knowledge in the following subjects is deemed necessary:
Analysis: limit of sequence \(\lim_{n\rightarrow\infty} a_n\), radius of convergence of \(f(z) = \sum_{n=0}^\infty a_n z^n\), asymptotics such as \(\Theta(n^{n+1/2}e^{-n})\) and \(n!\sim \sqrt{2\pi n} (\frac ne)^n\)
Probability: expected values of discrete and continuous probability distribution
Linear Algebra: arithmetics of vectors and matrices like computing \(\vec{y}^\textsf{T} \mathbf{A} \vec{x} \), solving linear systems \(\mathbf{A} \vec{x} = \vec{b}\), Cramer's rule