Instructor: Alexander Postnikov
Office hour: Thursday, 4-5 pm
Grader: Pavlo Pylyavskyy
Combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Enumeration, generating functions, recurrence relations, construction of bijections. Introduction to graph theory.
Course Level: Undergraduate
Introductory Combinatorics, R. Brualdi,
3rd or 4th edition, Prentice Hall.
* A Walk through Combinatorics, M. Bona, World Scientific, 2002.
* Enumerative Combinatorics, Vol 1 and Vol 2, by R. P. Stanley, Cambridge University Press, 1996 and 1999.
Grading: 3 quizes 25% each, problem sets 25%, + bonuses.
Problem Sets: Due every second Thursday.
Bonuses: You can get a grading bonus if you (a) write an article in combinatorics; (b) invent a new interesting integer sequence and publish it in Sloan's Encyclopedia; (c) find a new interpretation of the Catalan numbers that is not listed in Stanley's EC2 and Catalan Addendum; (d) solve some of the optional bonus problems in problem sets; or (e) solve some of the problems from the following list of
7 open problems: PostScript and PDF
Lectures: (tentative schedule)
R 11/11/2004. No class: Veterans Day
R 11/25/2004. No class: Thanksgiving