
Announcements: 
I have determined the grades for the final and the course. I will not be posting them anywhere, you will need to email me if you would like to know what they are before they are released. If you would like to look at your exam you will most likely find me in my office on Tuesday and Thursday during the months of May and June although it will be best to email me to make an appointment to make sure that I will be there. 
The final exam is listed as due April 18, 2003. I
recently found out that the university offices are closed that day
(my guess is that there are no finals scheduled either). If you would
like to hand in the exam that day slip it under my door in S615 or give it to me
if I am there. Otherwise hand it in on Monday either to N520 or my office
in S615. 
On the final there is one mistake I have found
so far. The sum in test 1 problem number 13 should be
from l=0 to nk and not from l=0 to n. Your proof should uncover
this error. Also it must be that 1 <= r <= k. The grad student
version seems to be OK. 
I will have office hours Monday April 7, 2003 from 13pm
and Tuesday April 15, 2003 from 12pm2pm. 
(3/31/03) The final exam will be takehome. I will try to have it ready
by Friday morning (the last day of class) and I will give you the chance to
discuss it before you have
two weeks to work on the exam (it should take 3 hours). I will be available to
answer questions for at least a few hours the week before the exam is due. 
Problem number 1 and 2 of homework 5
in the Burnside's theorem and Polya
enumeration section have to do with the symmetries of the cube. This really isn't
hard if you look carefully at something like a die or a block. You do not need to
write down a single permutation, just the cycle structure. I have written
a few hints to get you started. 
The midterm exams will be on Friday, January 31 and Friday, March 7 
The homework assignment #3 is due Feb 24, 10:30am 
York University Professor Mike Zabrocki MWF 10:3011:30am FC034C Office: Ross S615 Office hours: W45pmF11:30am12:30pm or by appointment 
Best way to contact me: 
Topics: algebra of sets, permutations,
combinations, occupancy problems, partitions of integers, generating
functions, combinatorial identities, recurrence relations, inclusionexclusion
principle, Polya's theory of counting, permanents, systems of distinct
representatives, Latin rectangles, block designs, finite projective
planes, Steiner triple systems. 
Prerequisites: AS/SC/AK/MATH 2022 3.0
or AS/SC/AK/MATH 2222 3.0; six credits from 3000level MATH courses
(without second digit 5); or permission of the course coordinator. 
Text: An introduction to combinatorics by Alan
Slomson 
The grade in this course will be based on the
following criterion: 
1. Homework (5) 20% 
2. Midterm exams (2) 40% 
3. Final exam 40% 
The homework is for your benefit so it is in
your interest to spend some time doing the problems each week. Struggle
with them for a while before getting help from either myself, the TA, or
your fellow students. Do not copy homework assignments. 
Week 
Topic/sections in text 
Homework 
Solutions 
1 
Basic counting principles 

2 
More basic counting 
HW #1  HINTS 
HW #1 
3 
Combinatorial proofs inclusionexclusion 
HW #2 

4 
Partitions and generating functions 
Alt exam 
MT #1 problem #4
HW2 
5 
Partitions and generating functions 
HW #3 

6 
Reading week 
Alt exam 

7 
Generating functions 
HW #4 
HW #3 
8 
Generating functions, take home 2nd midterm 
HW #4 

9 
groups 
HW #5 
MT #2 
10 
the group of permutations 


11 
permutations and symmetry 


12 
Polya enumeration 

HW #5 