Lectures: MWF 1:00, 2-136
Lecturer: Richard Stanley, 2-375, x3-7930, rstan@math.mit.edu
Lecturer office hours: MWF 12:00-1:00, or by appointment
Problem set grader: Jingbin Yin, 2-333
Grader office hour: Friday, 2-3 (on September 19: 3-4)
Text: Miklos Bóna, A Walk Through Combinatorics, second ed., World Scientific, Singapore, 2006.
Errata maintained by the author: click here.
Summary of material: Chapters 1-13 and some additional material related to the Matrix-Tree theorem
Grading: Problem sets 20%, two hour exams 20% each (on October 8 and November 12), final exam 40%. There is no curve, but I suspect the average grade will be B.
Problem sets: Problem set assignments are available from the course syllabus. Problem sets are due in lecture each Monday (or the first day of classes of that week if Monday is a holiday) for assignments of the previous week. Since solutions to problem sets will be made available shortly after the deadline for handing them in, in general late problem sets will not be accepted without a valid excuse such as illness. "Reasonable" collaboration is permitted on problem sets, but you should not just copy someone else's work or look up the solution from an outside source.
Assignments: a separate listing of the problem set assignments according to date due.