Stockholm university
Gå till denna sida på svenska webben

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.