Introduction to Combinatorics Math 4160

Announcements:

I have determined the grades for the final and the course. I will not be posting them anywhere, you will need to e-mail 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 e-mail 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 n-k 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 1-3pm and Tuesday April 15, 2003 from 12pm-2pm.

(3/31/03) The final exam will be take-home. 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