Welcome to Enumerative Combinatorics!

This course covers the basics of modern enumerative combinatorics, the field of mathematics devoted to counting (or enumerating) finite sets of objects. We will explore different ways to count the objects in a collection of finite sets and what it means to have a ``good formula'' for these cardinalities. Fundamental techniques to be discussed include the Principle of Inclusion-Exclusion, the Determinantal Method, bijective methods, and generating function techniques. In exploring how to count, we will learn about some of the fundamental combinatorial objects that are of particular interest in the field, such as permutation statistics, posets, hyperplane arrangements, and lattice polytopes.

Lectures

Fridays 10.00-12.00

The lectures are complemented by five exercise sessions which will take place Fridays 13-15.

Dates and times can be found in the Course Plan as well as the Schedule.

Observe: Lecture halls keep changing (!!)

Teachers

Katharina Jochemko (jochemko@kth.se) teacher, examiner
Jon Pål Hamre (jphamre@kth.se) teaching assistant

Student representatives

Nami Arabyarmohammadi (nami@math.su.se)
Tuva Hirschberg (tuvah@kth.se)
Veronika Körber (vekor@kth.se)
Nicholas Schirtzinger (schirt@kth.se)

Important Information

Content and Schedule
Examination
Homeworks
Paper review
Funka

More general information about the course can be found here.

For administrative matters such as registration for the course and the final exam we refer you to the studentexpeditionen.