Analytic Combinatorics

Princeton University

Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for deriving accurate asymptotics from the GF equations.

Analytic Combinatorics is based on formal methods for deriving functional relationships on generating functions and asymptotic analysis treating those functions as functions in the complex plane. This course covers the symbolic method for defining generating functions immediately from combinatorial constructions, then develops methods for directly deriving asymptotic results from those generating functions, using complex asymptotics, singularity analysis, saddle-point asymptotics, and limit laws. The course teaches the precept "if you can specify it, you can analyze it".


Lecture  1  Combinatorial Structures and OGFsLecture  2  Labelled Structures and EGFsLecture  3  Combinatorial Parameters and MGFsLecture  4  Complex Analysis, Rational and Meromorphic AsymptoticsLecture  5  Applications of Rational and Meromorphic AsymptoticsLecture  6  Singularity Analysis of Generating FunctionsLecture  7  Applications of Singularity AnalysisLecture  8  Saddle-Point Asymptotics

Recommended Background

Familiarity with recurrences, generating functions, asymptotics and basic combinatorics as taught in Analysis of Algorithms. Basic familiarity with programming in Java and the algorithms and data structures covered in Algorithms, Part I is helpful but not required. The video From Analysis of Algorithms to Analytic Combinatorics: A Journey with Philippe Flajolet, is an optional overview that tries to answer the question "What is Analytic Combinatorics" and to give some historical perspective.

Suggested Readings

This course is based on the textbook Analytic Combinatorics by Flajolet and Sedgewick. The (free) web materials associated with the course and the textbook can be found at

Course Format

There will be one lecture (about 80 minutes) and a problem set each week.


Does Princeton award credentials or reports regarding my work in this course?

No certificates, statements of accomplishment, or other credentials will be awarded in connection with this course.

  • 6 ноября 2015, 6 недель
  • 20 марта 2015, 6 недель
  • 31 октября 2014, 6 недель
  • 28 марта 2014, 6 недель
  • 1 ноября 2013, 6 недель
Характеристики онлайн курса:
  • Бесплатный:
  • Платный:
  • Сертификат:
  • MOOC:
  • Видеолекции:
  • Аудиолекции:
  • Email-курс:
  • Язык: Английский Gb


Пока никто не написал отзыв по этому курсу. Хотите быть первым?

Зарегистрируйтесь, чтобы оставить отзыв

Входит в подборки курсов:
6-046jf05 Algorithms
Algorithms and data structures from the beginning to advanced analysis.
Ещё курсы на эту тему:
18-315s05 Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics
This course serves as an introduction to major topics of modern enumerative...
Aofa-logo Analysis of Algorithms
This course teaches a calculus that enables precise quantitative predictions...
42282_26ef_5 Google Analytics Training: Using GA for Actionable Insights
Learn how to use Google Analytics to make important business decisions. Understanding...
18-997s04 Topics in Combinatorial Optimization
In this graduate-level course, we will be covering advanced topics in combinatorial...
21m-350s08 Musical Analysis
This class is an introduction to the analysis of tonal music. Students develop...
Ещё из рубрики «Компьютерные науки»:
Maxresdefault CS 282: Principles of Operating Systems II: Systems Programming for Android
Developing high quality distributed systems software is hard; developing high...
Banner_ruby Ruby on Rails Tutorial: Learn From Scratch
This post is part of our “Getting Started” series of free text tutorials on...
Logo-30-128x128 NYU Course on Deep Learning (Spring 2014)
Lectures from the NYU Course on Deep Learning (Spring 2014) This is a graduate...
Cppgm C++ Grandmaster Certification
The C++ Grandmaster Certification is an online course in which participants...
Umnchem Computational Chemistry (CHEM 4021/8021)
Modern theoretical methods used in study of molecular structure, bonding, and...
Ещё от Coursera:
Success-from-the-start-2 First Year Teaching (Secondary Grades) - Success from the Start
Success with your students starts on Day 1. Learn from NTC's 25 years developing...
New-york-city-78181 Understanding 9/11: Why Did al Qai’da Attack America?
This course will explore the forces that led to the 9/11 attacks and the policies...
Small-icon.hover Aboriginal Worldviews and Education
This course will explore indigenous ways of knowing and how this knowledge can...
Talk_bubble_fin2 Accountable Talk®: Conversation that Works
Designed for teachers and learners in every setting - in school and out, in...
Coursera_accounting_460x259 An Introduction to Financial Accounting
This course will improve your fluency in financial accounting, the language...

© 2013-2019