Basic methods in enumerative combinatorics. Sieve methods, for example inclusion-exclusion and the method of using determinants to count lattice paths. Various aspects of the theory of partially ordered sets, for example lattice theory, Möbius inversion in posets, P-partitions.
Intended learning outcomes *
After the course the student should be able to
explain basic concepts. theorems and proofs within the parts of enumerative combinatorics described by the course content,
Announced no later than 4 weeks before the start of the course on the course web page.
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale *
A, B, C, D, E, FX, F
Grading scale: A, B, C, D, E, FX, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
Homework problems and possibly a written report on a research paper.
The examiner decides, in consultation with KTHs Coordinator of students with disabilities (Funka), about any customized examination for students with documented, lasting disability. The examiner may allow another form of examination for re-examination of individual students.
Opportunity to complete the requirements via supplementary examination
No information inserted
Opportunity to raise an approved grade via renewed examination