Last updated 18 Jan 2017.
In order to encourage students to experiment with the concepts taught in class, homework assignments will be given on alternate weeks. They will be due in class on Fridays, at the beginning of lecture.
Since homework is a learning activity, students are welcome to discuss ideas with each other, although collaboration in the writing stage is not permitted. In other words, please do not look at the actual document that another student is handing in.
Make-up exams will be given only in the case of a documented medical excuse, a university-sanctioned absence (e.g., participation in a varsity sporting event), or a family emergency. However, this must be requested before the official start time of each exam.
|Week||Topic||Alternate reference||Work due Fri|
(Mon Jan 16)
|Basic counting; induction||Chapter 1; Fwd-backward induction|
(Mon Jan 23)
Dirichlet's approximation theorem
(Mon Jan 30)
(Mon Feb 6)
|Binomial coefficients||Chapter 3; Lucas' Theorem||Exam 1 on Fri|
(Mon Feb 13)
|Linear algebra and recurrences||Chapter 4; Wikipedia, Croot's notes||Homework 3|
(Mon Feb 20)
|Generating functions||Generatingfunctionology (free book),
by H. Wilf. Sections 1.1-1.3, 2.1-2.3;
notes from MIT's OpenCourseWare
(Mon Feb 27)
|More generating functions||Homework 4|
(Mon Mar 6)
|Introduction to graphs
(No class Fri Mar 10)
(Mon Mar 13)
(Mon Mar 20)
(Mon Mar 27)
|Traveling salesman problem||Chapter 9|
(Mon Apr 3)
|Matchings||Chapter 10||Homework 6|
(Mon Apr 10)
|Combinatorial geometry||Chapter 11|
(Mon Apr 17)
(No class Fri Apr 21)
from B. Sudakov's
Princeton Combinatorics course.
(Mon Apr 24)
|Planar graphs||Chapter 12|
(Mon May 1)
|In TBA, from TBA.|
|You are visitor number since 18 January 2017.|