We will explore combinatorial classes by

- Meeting classical discrete objects
- Counting them
- Finding bijections between classes
- Generating random elements
- Using search algorithms on classes

- Review questions for the final exam.
- Assignment 5 due date extended until Monday March 11 in class.
- Project guidelines. Important dates: choose project vs final by
**March 11**, choose topic by**March 18**, due**April 11**. - Midterm solutions.
- Midterm review questions and notes on the upcoming midterm.
- On Tuesday Jan 22 the 3:30-4:20 office hours are
**cancelled**. - More office hours: Tuesdays and Thursdays 10:00-10:20.
- Typo in assignment 1 corrected.
- I've requested a webct container for the use of its discussion list; it should appear in a few days.
- The midterm is
**Thursday, February 21**in class. An updated syllabus is below.

- Assignment 1, due Thursday January 17 in class. Solutions.
- Assignment 2, due Thursday January 24 in class. Solutions.
- Assignment 3, due Thursday February 7 in class. Solutions.
- Assignment 4, due Thursday February 28 in class. Solutions.
- Assignment 5, due Monday March 11 in class. Solutions.
- Assignment 6, due Thursday March 21 in class. Solutions.
- Assignment 7, due Thursday March 28 in class. Solutions.

I suggest you print out the lecture blanks and bring them to class.

The notes are something like a textbook appearing one section at a time and are based on notes by Marni Mishna. Let me know if you find any typos.

- Lecture 1: notes and lecture blanks.
- Lecture 2: notes and lecture blanks.
- Lecture 3: notes and lecture blanks.
- Lecture 4: notes and lecture blanks.

Additional notes on other constructions. - Lecture 5: notes (no blanks as Steve will be lecturing)
- Lecture 6: notes and lecture blanks and a text file of maple examples.
- Lecture 7: notes and lecture blanks.

Additional notes on labelled counting. - Lecture 8: notes and lecture blanks.
- Lecture 9: notes and lecture blanks.
- Lecture 10: notes and lecture blanks.

On Monday February 18 we will discuss the midterm and do review questions. - Lecture 11: notes and lecture blanks and a maple function.
- Lecture 12: notes and lecture blanks and a maple function.
- Lecture 13: notes and lecture blanks and maple functions.
- Lecture 14: notes and lecture blanks.
- Lecture 15: notes and lecture blanks.
- Lecture 16: notes and lecture blanks.
- Lecture 17: notes and lecture blanks.
- Lecture 18: notes and lecture blanks.
- Lecture 19: notes and lecture blanks.
- Lecture 20: notes and lecture blanks.
- Lecture 21: notes and lecture blanks.
- Lecture 22: notes and lecture blanks.

On Thursday April 11 we will look at the review questions for the final.

- Herbert Wilf, generatingfunctionology. Academic press (1990), 2nd edition (1994), 3rd edition AK Peters (2005)
- Donald Kreher and Douglas Stinson,
*Combinatorial Algorithms*. CRC Press (1999)

- Instructor:
- Karen Yeats
- Office:
- SC K 10508
- Email:
- karen_yeats at sfu.ca
- Office Hours:
- 10:00-10:20 and 3:30-4:20 Tuesdays; 10:00-10:20 and 1:30-2:20 Thursdays.
- Lectures:
- 2:30-3:20 Mondays in AQ5018 and 2:30-4:20 Thursdays in WMC3510
- Tutorial:
- 4:30-5:20 Tuesdays in WMC3253

There is no textbook for the course