Combinatorial Theory (Math 206, Fall 2012)

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

Class schedule: MWF 12:00 - 12:50, MS 6201

Office Hours: M 3-4, MS 6125

Textbook: Richard Stanley, Enumerative Combinatorics (EC), vol 1 (second edition), and vol. 2.
Download vol 1 from the author's website.

Additional reading will be posted on this page if necessary.

Grading: The grade will be 100% based on homeworks.

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 EC1 and EC2.

Additional reading:

H. Wilf, What is an answer?, Monthly article.
I. Pak, Partition Bijections, a Survey, Ramanujan Journal.

Home Assignments

Home assignments will be posted here in .pdf format.. They will have a large number of moderate to difficult problems on different topics within the scope of the course.

HA1 (due Oct 19, 2012). Download here.

Midterms, Final: N/A.

Collaboration Policy

For the homeworks, you can form discussion groups of up to 3 people each. In fact, I would like to encourage you to do that as collaborative research is an extremely useful skill to learn. You can discuss problems but have to write your own separate solutions. You should write the list of people in you group on top of each HA.

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 9/29/2012