Basic methods in enumerative combinatorics. "The twelvefold way" (counting functions subject to various restrictions), sieve methods such as different versions of inclusion-exclusion, the involution principle and determinantal lattice path counting. Various aspects of the theory of partially ordered sets, e.g. lattice theory. Möbius inversion in posets and connections to topology.

Richard P. Stanley, Enumerative Combinatorics, volume 1, second edition, Cambridge University Press, 2011. For more information about this text, see here.

Homework assignments and a literature project.

Axel Hultman

Page responsible: axel.hultman@liu.se
Last updated: 2019-11-29