18.314 Combinatorial Analysis

Fall 2005

Set partitions and rook placements.

Set partitions and rook placements. (Image by Prof. Postnikov.)

Course Highlights

This course features a readings section, a complete set of assignments, and exams.

Course Description

This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms and, extremal combinatorics.
Donate Now

Staff

Instructor:
Prof. Alexander Postnikov

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Level

Undergraduate