Skip to content

Your Cart


You have 0 items in your cart.

Register Sign in Wishlist

Analytic Combinatorics

$113.00 (P)

Award Winner
  • Date Published: January 2009
  • availability: Available
  • format: Hardback
  • isbn: 9780521898065

$ 113.00 (P)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • Comprehensive: generous notes, appendices, examples and exercises, as well as the inclusion of proofs of fundamental results
    • Unified: ties together classical mathematics and modern applications
    • Cutting edge: first book with extensive coverage of analytic methods needed to analyse large combinatorial configurations
    Read more


    • Winner of the Choice Outstanding Academic Title 2009

    Reviews & endorsements

    "... this is a valuable, comprehensive treatment."
    Angele M. Hamel,

    "... certain to become the standard reference book of the field. While Analytical Combinatorics has more than enough information to become a reference book, it is also written in a reader-friendly style that makes it appropriate as a course resource. In the past, it was not always clear what "analytic combinatorics" meant; this book will bring about a consensus on that question."
    M. Bona, Choice Magazine

    "Because of the breadth, and depth of topical coverage, the highly applicable results and the enjoyable writing that characterize this book, Analytic Combinatorics is now defined. The authors wrote the book on it."
    Miklos Bona, SIGNACT News

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 2009
    • format: Hardback
    • isbn: 9780521898065
    • length: 826 pages
    • dimensions: 249 x 178 x 43 mm
    • weight: 1.56kg
    • contains: 74 b/w illus. 50 tables
    • availability: Available
  • Table of Contents

    An invitation to analytic combinatorics
    Part A. Symbolic Methods:
    1. Combinatorial structures and ordinary generating functions
    2. Labelled structures and exponential generating functions
    3. Combinatorial parameters and multivariate generating functions
    Part B. Complex Asymptotics:
    4. Complex analysis, rational and meromorphic asymptotics
    5. Applications of rational and meromorphic asymptotics
    6. Singularity analysis of generating functions
    7. Applications of singularity analysis
    8. Saddle-Point asymptotics
    Part C. Random Structures:
    9. Multivariate asymptotics and limit laws
    Part D. Appendices: Appendix A. Auxiliary elementary notions
    Appendix B. Basic complex analysis
    Appendix C. Concepts of probability theory

  • Resources for

    Analytic Combinatorics

    Philippe Flajolet, Robert Sedgewick

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.

    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email

  • Authors

    Philippe Flajolet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
    Philippe Flajolet is Research Director of the Algorithms Project at INRIA Rocquencourt.

    Robert Sedgewick, Princeton University, New Jersey
    Robert Sedgewick is William O. Baker Professor of Computer Science at Princeton University, New Jersey.


    • Winner of the Choice Outstanding Academic Title 2009

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.