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.

Offered By

## Analytic Combinatorics

Princeton University## About this Course

### Offered by

#### Princeton University

Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.

## Syllabus - What you will learn from this course

**2 hours to complete**

## Combinatorial Structures and OGFs

Our first lecture is about the symbolic method, where we define combinatorial constructions that we can use to define classes of combinatorial objects. The constructions are integrated with transfer theorems that lead to equations that define generating functions whose coefficients enumerate the classes. We consider numerous examples from classical combinatorics.

**2 hours to complete**

**7 videos**

**2 readings**

**1 practice exercise**

**2 hours to complete**

## Labelled Structures and EGFs

This lecture introduces labelled objects, where the atoms that we use to build objects are distinguishable. We use exponential generating functions EGFs to study combinatorial classes built from labelled objects. As in Lecture 1, we define combinatorial constructions that lead to EGF equations, and consider numerous examples from classical combinatorics.

**2 hours to complete**

**7 videos**

**1 reading**

**1 practice exercise**

**2 hours to complete**

## Combinatorial Parameters and MGFs

This lecture describes the process of adding variables to mark parameters and then using the constructions form Lectures 1 and 2 and natural extensions of the transfer theorems to define multivariate GFs that contain information about parameters. We concentrate on bivariate generating functions (BGFs), where one variable marks the size of an object and the other marks the value of a parameter. After studying ways of computing the mean, standard deviation and other moments from BGFs, we consider several examples in some detail.

**2 hours to complete**

**1 reading**

**1 practice exercise**

**3 hours to complete**

## Complex Analysis, Rational and Meromorphic Asymptotics

This week we introduce the idea of viewing generating functions as analytic objects, which leads us to asymptotic estimates of coefficients. The approach is most fruitful when we consider GFs as complex functions, so we introduce and apply basic concepts in complex analysis. We start from basic principles, so prior knowledge of complex analysis is not required.

**3 hours to complete**

**6 videos**

**1 reading**

**1 practice exercise**

## Reviews

### TOP REVIEWS FROM ANALYTIC COMBINATORICS

Very good class if you're into computer science and enjoy abstract math. There are a few typos in the quizzes that could easily be fixed: make sure you check the forum.

Excellent course. One minus is that there are some unfortunate typos/errors in the quizzes.

## Frequently Asked Questions

When will I have access to the lectures and assignments?

More questions? Visit the Learner Help Center.