Enumerative Combinatorics (syllabus)

textbook cover
Fibonacci numbers
pigeonhole principle
Carl Gauss
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.
Gregory G. Smith (512 Jeffery Hall, ggsmith@mast.queensu.ca)
(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
Wednesday at 16:30–17:20 in 201 Jeffery Hall.
Monday, 13 December 2021 at 19:00–22:00 in Gym 3 (Bartlett) Mitchell Hall.
The course grades will be computed as follows:
  • 40% Homework 50% Homework
  • 40% Project 50% Project
  • 20% Exam
Problem sets are posted in PDF on the lectures webpage. Your browser can be trained to open these files with the free program Acrobat Reader (or other PDF viewer). Solutions to each problem set will be submitted via the Crowdmark system. Instructions for using this software are available. The solution to each problem must be uploaded separately. Solutions are due on Fridays before 17:00; late homework will receive no credit. Your best five solution sets will determine your homework grade.
We write to communicate. Please bear this in mind as you complete homework, your project, and the exam. Work must be neat and legible to receive consideration. You must explain your work in order to obtain full credit; an assertion is not an answer.
Academic Integrity
Students are responsible for familiarizing themselves with all of the regulations concerning academic integrity and for ensuring that their assignments and their behaviour conform to the principles of academic integrity. Students are welcome to discuss problems, but should write up the solutions individually. Students must explicitly acknowledge any assistance including books, software, technology, websites, students, friends, professors, references, etc.
The instructor is committed to achieving full accessibility for people with disabilities. Part of this commitment includes arranging academic accommodations for students with disabilities to ensure they have an equitable opportunity to participate in all of their academic activities. If you are a student with a disability and think you may need academic accommodations, then you are strongly encouraged to contact the instructor and the Queenʼs Student Accessibility Services (QSAS) as early as possible.
Materials generated by the instructors of this course may not be used for commercial advantage or monetary compensation. Some material is clearly copyrighted and may not be reproduced or retransmitted in any form without express written consent. Other material, licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License, may be remix, adapt, or build upon it, as long as appropriate credit is given and the new creation is distributed under the identical terms.
Students are encouraged to use any available technology on the homework and project, but these aids will not be allowed during the exam.
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete mathematics, Second Edition, Addison-Wesley, 1994, ISBN: 0-201-55802-5.