Fall 2000
Course meets: MWF 2:103, 4096 East Hall.
Instructor: Sergey Fomin, 2858 East Hall, 7646297, fomin@math.lsa.umich.edu
Office hours: MWF 121 in 2858 East Hall (and by appointment).
Course homepage: http://www.math.lsa.umich.edu/~fomin/565.html
Level: introductory graduate/advanced undergraduate.
Prerequisites: No prior knowledge of combinatorics will be assumed. Basic algebra (mostly linear; Math 512/513 or equivalent) will be used throughout.
Student work expected: several problem sets.
Synopsis: The ultimate fun course, with a focus on problem solving, showcasing the gems of enumerative and algebraic combinatorics. The course will cover over a dozen of virtually independent topics, chosen solely on the basis of their beauty. Topics will include generating functions, algebraic graph theory, partially ordered sets, combinatorics of polytopes, matching theory, enumeration of tilings, partitions, and Young tableaux.
Topics covered:

Reference texts (none required):
This course has substantial overlap with Math 192 at Harvard, taught by Richard Stanley (M.I.T.).