MAI0102 Enumerative combinatorics

Lecture plan

Date	We did/plan to do:
Sep 20	1.1. How to count.
Sep 27	1.2–3. Multisets, permutations.
Oct 4	1.4,8–9. The twelvefold way, partitions.
Oct 11	1.9, 2.1–2. More on Stirling numbers. Sieve methods.
Oct 18	2.3–4. Permutations with restricted positions.
Oct 25	2.6–7. Lattice paths.
Nov 1	3.1–2, parts of 3.3. Posets, lattices.
Nov 8	3.3, parts of 3.4. Distributive lattices.
Nov 16	3.4–5. More on distributive lattices. Linear extensions.
Nov 22	3.6–7. Incidence algebras, Möbius inversion.
Nov 29	3.8. Computing Möbius functions. Exercise 3.84: Crapo's theorem.

Sidansvarig: axel.hultman@liu.se
Senast uppdaterad: 2019-11-29