Math 413 (Introduction to Combinatorics): (Fall 2009)

Instructor: Alexander Yong ayong@math.uiuc.edu

Lectures: MWF 2:00-2:50pm 347 Altgeld

Office Hours: By appointment only, but in particular, I'm free MW 3:00-4:00pm (right after class, in my office 335 Illini Hall)

Textbook: Brualdi, "Introductory Combinatorics" (5th ed, although 4th ed should also be fine, I'll list the same problems from both editions).

Syllabus: Chapters 1-8 of Brualdi and special topics (time permitting)

Grading: Weekly assignments 30% (I will drop the lowest two assignment grades), Three Midterms 15%+15%+15%, Final Exam 25%. I will maintain grades online through the math department grading system (details to come). Any missed midterm tests will be dropped and the final exam re-weighted accordingly, provided you have a doctor's note that indicates lack of fitness due to a medical issue (including flu-like symptoms). If a medical concern results in missed final exam, a make-up exam will be offered.

Test dates: All midterms are in class. Test 1: September 23, 2009. Test 2: October 28, 2009. Test 3: December 2, 2009. Final exam: this is regulated by the Non combined guidelines . As our class meets Mondays at 2:00 pm, the final is December 11, 2009 (1:30-4:30pm). The location will be announced later, when it is determined.

Miscellaneous: I ask that you attend each class. Exchange numbers with fellow classmates. In particular, collaboration on assignments is encouraged (although I request that you simply acknowledge those who you work with and write up your own solutions). Reading the relevant sections before class to help facilitate learning through discussion, both between you and I, and between other participants and yourself. [Although probably most of the above requests seem like boilerplate for _any_ course, as combinatorics emphasizes learning through problem solving, doing the above is especially important.]

Lecture notes and summaries: I'll post any web accessible materials below.

Lecture 1

Lecture 2

Lecture 3

Lecture 4

Lecture 5

Lecture 6

Lecture 7

Lecture 8

Lecture 9

Practice Midterm 1

Practice Midterm 1 with Solutions

Midterm 1 with Solutions

Lecture 10

Lecture 11

Lecture 12

Chapter 5 in class exercises

Lecture 13

Lecture 14

Lecture 15

Chapter 6 in class exercises

HW (chapter 6): Section 6.7 edition 5: 17,24(c),25,28,32; edition 4: 17,24(c),25,28,31. [Due Monday October 19, 2009.]

Lectures 16-19 were handed out in class (laptop malfunction).

Chapter 7 in class exercises

HW (chapter 7): Section 7.7 edition 5: 9,11,14,16,20; edition 4 section 7.8: 9,11,29,34,38. [Due Monday October 26, 2009.]

More Chapter 7 in class exercises

Practice Midterm 2

Practice Midterm 2 with Solutions

Midterm 2 with Solutions

HW 8 (chapter 7): Section 7.7 edition 5: Q23, Q25, Q33 ; edition 4: Q41, Q43, Q30(e) AND THE FOLLOWING TWO EXTRA QUESTIONS:

Q: Find the exponential generating series, and identify the appropriate coefficient, for the number of ways to deal a sequence of 13 cards (from a standard 52 card deck) if the suits are ignored and only the values of the cards are noted.

Q: Show that ex/(1-x) n is the exponential generating function for the number of ways to choose some subset (possibly empty) of r distinct objects and distribute them into n different boxes with the order in each box counted.

Lecture 20

Lecture 21

Lecture 22

Lecture 23

Lecture 24