Analytic Combinatorics

Philippe Flajolet

ISBN 10: 0521898064 / ISBN 13: 9780521898065

Edité par Cambridge University Press, 2009

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - Analytic combinatorics aims to enable precise quantitative predictions of the properties 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 enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

N° de réf. du vendeur 9780521898065

Détails bibliographiques

• Titre: Analytic Combinatorics
• Éditeur: Cambridge University Press
• Date de parution: 2009
• Langue: anglais
• ISBN à 10 chiffres: 0521898064
• ISBN à 13 chiffres: 9780521898065
• Reliure: Buch
• État de l'article: Neu

A propos de ce titre

Synopsis

Analytic combinatorics aims to enable precise quantitative predictions of the properties 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 enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

À propos des auteurs

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, New Jersey.