Math 521 syllabus

Enumerative Combinatorics

Course Description:  Pigeonhole principle, basic counting techniques, binomial coefficients, inclusion-exclusion principle, recurrence relations, generating functions, systems of distinct representatives, finite fields.

Suggested Textbooks:  Introduction to Enumerative Combinatorics by Miklos Bona;
A Course in Enumeration by Martin Aigner.

 

Learning outcomes: Upon the successful completion of the course a student will:

know various counting methods
apply counting methods to solve a wide variety of enumeration problems