Course Information

Instructor: Vidya Venkateswaran
E-mail: vidyav at math dot mit dot edu
Office Hours: Friday 2-4pm in office E17-331.

Teaching Assistant: Benjamin Iriarte Giraldo
E-mail: biriarte at math dot mit dot edu
Office Hours: Monday 3-4pm in Stata Center, 32-D516.

Class lectures: Tuesday and Thursday, 1.00 - 2.30pm in room E17-122

Course description: Combinatorial problems and methods for their solutions. Prior experience with abstraction and proofs is helpful. Topics include: enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms, extremal combinatorics.

Course level: undergraduate

Textbook: Miklos Bona, A Walk Through Combinatorics World Scientific, 2002 (Third Edition). See also Author's errata, errata by R. Ehrenborg, errata by R. Stanley.

Additional Reading: Enumerative Combinatorics, Vol 1 and Vol 2, by R. Stanley, Cambridge University Press, 1996 and 1999. Introductory Combinatorics, R. Brualdi, 3rd or 4th edition, Prentice Hall.

Problem sets: Homework will be due weekly (unless otherwise indicated); it should be handed in during class. The assigned problems will be posted on the course website at least a week in advance. Late problem sets will not be accepted unless arrangements have been made with the instructor in advance. A problem marked by * is a bonus problem and is optional.

Collaboration policy: Working together on problem sets is allowed, and even encouraged. However, you *must* write up your solutions in your own words to prove that you understand the ideas behind the solution. This process will also help you learn to communicate mathematical ideas clearly and effectively. Please indicate on your problem set the names of your collaborators and other sources of information. Obviously you may not consult solutions to homework problems from external sources (e.g., previous year's classes, solutions found on the internet, etc.).

Disability accommodation: If you have a disability accommodation letter from SDS, please speak with the Mathematics disabilities accommodation coordinator Galina Lastovkina in MAS (galina at math dot mit dot edu) as soon as possible to make arrangements for the semester.

Exams: There will be three in-class exams, tentatively scheduled for Tuesday Oct 1, Tuesday Nov 5, and Thursday Dec 5. Please make sure you have no time conflicts. There will be no final exam.

Grading: Your final grade will be computed as follows

25% Exam 1 + 25% Exam 2 + 25% Exam 3 + 25% Problem sets

Grading complaints: If you believe a problem on a homework assignment or exam has been graded incorrectly, or that your score was not correctly recorded, you may bring it to the attention of the grader or instructor during office hours within two weeks of receiving the graded assignment or exam in question.

Course Calendar

Week Material Covered in Class Homework Problems Notes
September 2 Introduction, Chapter 1 Pset 1: 1.22, 1.29, 1.32, 2.18, 2.29, 2.33
solutions
Pset 1 due Thursday Sept 12
September 9 Chapter 2,3 Pset 2: 3.34, 3.38, 3.41, 4.36, 4.39, 4.41, 4.53*
solutions
Pset 2 due Thursday Sept 19
September 16 Chapter 4,5 Pset 3: 5.23, 5.24, 5.28, 5.32, 5.34 (only do the case k=1), 5.35
solutions
Pset 3 due Thursday Sept 26
September 23 Chapter 5,6 Practice problems (not to be turned in)

Exam 1 on Tuesday Oct 1
September 30 Chapter 6 Pset 4: 6.27, 6.28, 6.31, 6.38, 6.43, 6.49
solutions
Pset 4 due Tuesday Oct 8
October 7 Chapter 7,8 Pset 5: 7.16, 7.27, 7.36, 8.23, 8.24, 8.25 (use generating functions for the last three problems)
solutions
Pset 5 due Thursday Oct 17 (no class Tuesday Oct 15)
October 14,21 Chapter 8 Pset 6: 8.26, 8.28, 8.32, 8.35, 8.36, 8.37 and these additional problems
solutions
Pset 6 due Tuesday Oct 29
October 28 Chapter 9 Practice problems (not to be turned in)
Exam 2 on Tuesday Nov 5
November 4 Chapter 9,10 Pset 7: 9.24, 9.30, 9.33, 9.34, 9.41, 9.44
optional problems
solutions
Pset 7 due Tuesday Nov 12
November 11 Chapter 10 Pset 8: 10.21, 10.22, 10.27, 10.28, 10.36, 10.43
optional problems
solutions
Pset 8 due Tuesday Nov 19
November 18 Chapter 10 Pset 9: 10.39, 10.45 and these additional problems
optional problems
solutions
Pset 9 due Tuesday Nov 26
November 25 Chapter 11 Pset 10: 11.20, 11.21, 11.23, 11.24, 11.26, 11.30 solutions Pset 10 due Tuesday Dec 3 (no class Thursday Nov 28)
December 2 Chapter 11 Practice problems (not to be turned in)
Exam 3 on Thursday Dec 5

† Homework problems are from "A Walk Through Combinatorics" third edition, and 1.22 indicates chapter 1, problem 22.