Combinatorial Theory (Math 206, Fall 2019)

Instructor: Igor Pak
pak@math.ucla (add .edu at the end)

Class schedule: MWF 1:00 - 1:50 pm, MS 5118

Office Hours: M 2-2:50, MS 6125

Textbooks:

Richard Stanley, Enumerative Combinatorics (EC), vol 1 (second edition), and vol. 2.
Download vol 1 from the author's website.
Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics (AC)
Download the book website.
Andrew Odlyzko, Asymptotic enumeration methods (AEM), in Handbook of Combinatorics, vol. 2, Elsevier, 1995, pp. 1063-1229.
Download the survey here.

Additional reading will be posted below.

Grading: The grade will be 100% based on attendance, class participation and homeworks which will be posted below.

Difficulty: This is a graduate class in Enumerative Combinatorics. Students are assumed to be familiar with undergraduate Combinatorics and Graph Theory.

Content and Schedule

We will follow various sections from the above survey and monographs.

Additional reading:

H. Wilf, What is an answer?, Monthly article.
I. Pak, When and how n choose k, survey article on inversion from geometry.
I. Pak, Partition bijections survey (see esp. Section 9.6).

Click here to return to Igor Pak Home Page.

To e-mail me, click here and delete .zzz
Put Math 206 in the Subject line.

Last updated 10/7/2019.