ANALYTIC COMBINATORICS
Analytic combinatorics aims to enable precise quantitative predictions of the proper-
ties of large combinatorial structures. The theory has emerged over recent decades
as essential both for the analysis of algorithms and for the study of scientific models
in many disciplines, including probability theory, statistical physics, computational
biology and information theory. With a careful combination of symbolic enumera-
tion methods and complex analysis, drawing heavily on generating functions, results
of sweeping generality emerge that can be applied in particular to fundamental struc-
tures such as permutations, sequences, strings, walks, paths, trees, graphs and maps.
This account is the definitive treatment of the topic. In order to make it self-
contained, the authors give full coverage of the underlying mathematics and give a
thorough treatment of both classical and modern applications of the theory. The text is
complemented with exercises, examples, appendices and notes throughout the book to
aid understanding. The book can be used as a reference for researchers, as a textbook
for an advanced undergraduate or a graduate course on the subject, or for self-study.
PHILIPPE FLAJOLET is Research Director of the Algorithms Project at INRIA Roc-
quencourt.
ROBERT SEDGEWICK is William O. Baker Professor of Computer Science at Prince-
ton University.
(from print version, front)
