Enumerative Combinatorics

textbook cover
Fibonacci numbers
pigeonhole principle
set partition
Description
Enumerative combinatorics is primarily concerned with simultaneously counting the number of elements in an infinite collection of finite sets. Subsets, partitions, and permutations of an n-element set are classic examples. The techniques include double-counting, bijections, recurrences, and generating functions.
Prerequisites
MATH 210, MATH 211, or MATH 217.
Instructor
G.G. Smith (512 Jeffery Hall, ggsmith@mast.queensu.ca)
Lectures (slot 005)
Tuesday at 09:30–10:20 in 101 Jeffery Hall
Thursday at 08:30–09:20 in 101 Jeffery Hall
Friday at 10:30–11:20 in 101 Jeffery Hall
Office Hour
Thursday at 16:00–17:00 in 201 Jeffery Hall
Examination
To be scheduled by the University Registrar
Reference
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete mathematics, Second Edition, Addison-Wesley, 1994, ISBN: 0-201-55802-5.