Analytic Combinatorics (2009) [pdf]
This book presents analytic combinatorics, a methodology that connects combinatorial structures (like trees, permutations, and graphs) with generating functions and complex analysis, enabling precise asymptotic estimates of combinatorial quantities.
Background
- *Analytic Combinatorics* (2009) is a foundational textbook by Philippe Flajolet and Robert Sedgewick that connects the formal specification of combinatorial structures (e.g., trees, graphs, permutations) with their asymptotic counting via complex analysis.
- Philippe Flajolet (1948–2011) was a French computer scientist and INRIA researcher who pioneered this systematic approach; Robert Sedgewick is an American computer scientist known for algorithms textbooks (e.g., *Algorithms*).
- The book's core method: a combinatorial class is described by a generating function; analytic methods (singularity analysis, saddle-point integration) extract accurate growth estimates for the number of objects of size *n*.
- The field, "analytic combinatorics," is widely used in algorithm analysis, computational biology, statistical physics, and random-structure generation. The PDF is the full text, hosted on INRIA's servers.