Course meets: Tuesday and Thursday 11:40-1:00 in 2866 East Hall.
Instructor: Sergey Fomin, 2858 East Hall, 764-6297, firstname.lastname@example.org
Office hours: Tuesday 2:40-3:40 and Thursday 4:10-5:30 in 2858 East Hall.
Grader: Nina White, email@example.com.
Course homepage: http://www.math.lsa.umich.edu/~fomin/565f07.html
Level: introductory graduate/advanced undergraduate.
Prerequisites: No prior knowledge of combinatorics will be assumed. Linear algebra will be used throughout.
Student work expected: several problem sets.
Synopsis: Applications of algebra (mostly linear algebra) to combinatorics. Topics include: algebraic graph theory; enumeration methods; matchings, tilings, and electric networks; posets, partitions, and tableaux. The course will emphasize problem solving (as opposed to theory-building).
Topics covered (tentative list, subject to change):
Reference texts (none required):