Enumerative Combinatorics

textbook cover
Fibonacci numbers
pigeonhole principle
set partition
Description
Enumerative combinatorics is concerned with simultaneously counting the number of elements in an infinite collection of finite sets. Subsets, partitions, and permutations of an set n-element are classic examples. The techniques include double-counting arguments, recurrence relations, and generating functions.
Prerequisites
MATH 210, MATH 211, or MATH 217.
Instructor
G.G. Smith (512 Jeffery Hall, 613-533-2438, ggsmith@mast.queensu.ca)
Lectures (slot 001)
Mondays at 08:30–09:20 in 101 Jeffery Hall
Tuesday at 10:30–11:20 in 101 Jeffery Hall
Thursday at 09:30–10:20 in 101 Jeffery Hall
Office Hours
Tuesdays at 15:30–16:20 in 201 Jeffery Hall
Wednesdays at 17:30–18:20 in 201 Jeffery Hall
Examination
Thursday, 7 December 2017 from 14:00—17:00 in Dunning Hall
Reference
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete mathematics, Second Edition, Addison-Wesley, 1994, ISBN: 0-201-55802-5.