Enumerative combinatorics
In enumerative combinatorics we study methods to determine the number of objects that fulfil certain requirements, usually expressed in terms of combinations and permutations.
The course covers basic methods of enumerative combinatorics. Sieve methods, for example various examples of inclusion-exclusion, and determinant methods to count lattice paths. Different aspects of the theory of partially ordered sets, for example lattice theory, Möbius inversion in posets, P-partitions.
This course is given jointly with KTH. Information about the course at KTH.
-
Course structure
The course consists of one module.
Teaching format
Instruction consists of lectures and exercises.
Assessment
The course is assessed through written examination.
Exam information: how to sign up for exams at KTH
Examiner
A list of examiners can be found on
-
Schedule
The schedule will be available no later than one month before the start of the course. We do not recommend print-outs as changes can occur. At the start of the course, your department will advise where you can find your schedule during the course. -
Course literature
Note that the course literature can be changed up to two months before the start of the course.
Stanley: Enumerative combinatorics vol 1. Cambridge University Press.
-
More information
New student
During your studiesCourse web
Registered students get access to the KTH course web in Canvas.
-
Contact
