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.

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

Exam information

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.

Schedule for SF2741 at KTH (times only)

To see the where the lectures take place you need to be logged in to the KTH account which you will receive if you are admitted to this course. If students don't get their accounts before the course starts, we send out the schedule for the first week(s) by email.

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.

List of course literature Department of Mathematics

Course reports are displayed for the three most recent course instances.


New student
During your studies

Course web

Registered students get access to the KTH course web in Canvas.

Information about course web, KTH






Cookie settings

By allowing third-party services, you accept their cookies and the use of tracking technologies necessary for them to function properly.