Visa version
Version skapad av Petter Brändén 2016-10-18 13:29
Visa
< föregående
|
nästa >
Jämför
< föregående
|
nästa >
Schedule and content 2016
| Date | What have we done |
| 30/8 | Introduction. What is enumerative combinatorics? Ch. 1.1-1.2. Notes |
| 6/9 | Sets and multisets. Permutations. Ch. 1.2-1.3. Notes |
| 13/9 | Permutation statistics. Ch. 1.3-1.4. Notes |
| 20/9 | Tree representations, permutations of multisets. Ch. 1.5, 1.7. Notes |
| 27/9 | Set partitions, finite differences, Sieve methods Ch. 1.9, 2.1. Notes Here PDF is Homework 1, due October 11. |
| 4/10 | Inclusion-Exclusion, Rook polynomials Ch. 2.2-2.3. Notes |
| 11/10 | Rook polynomials, determinants and non-intersecting paths. Ch. 2.4, 2.7. Notes |
| 18/10 | Posets, lattices. Ch. 3.1-3.3. Notes |