Analytic Combinatorics
- 16h 39m
- Philippe Flajolet, Robert Sedgewick
- Cambridge University Press
- 2009
Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.
About the Authors
Philippe Flajolet is Research Director of the Algorithms Project at INRIA Rocquencourt.
Robert Sedgewick is William O. Baker Professor of Computer Science at Princeton University.
In this Book
-
Combinatorial Structures and Ordinary Generating Functions
-
Labelled Structures and Exponential Generating Functions
-
Combinatorial Parameters and Multivariate Generating Functions
-
Complex Analysis, Rational and Meromorphic Asymptotics
-
Applications of Rational and Meromorphic Asymptotics
-
Singularity Analysis of Generating Functions
-
Applications of Singularity Analysis
-
Saddle-Point Asymptotics
-
Multivariate Asymptotics and Limit Laws
-
Bibliography
