Welcome to the course SF2741 Enumerative Combinatorics!

This course focuses on the basics of modern enumerative combinatorics, the field of mathematics devoted to counting (or enumerating) finite sets of objects. In this course, 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 currently popular in the field, such as permutation statistics, posets, hyperplane arrangements, and lattice polytopes.

All information on the course literature, schedule, examination will be under Modules to the left.

Teachers:

Katharina Jochemko (jochemko@kth.se)

Svante Linusson (linusson@kth.se)

Luis Ferroni (ferroni@kth.se) Teaching assistent

Are you new at master level? We have prepared a short text on how to write a mathematical proof It uses examples from discrete mathematics and gives a few important elements that are needed for a proper mathematical proof.

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

SF2741 HT22 Enumerative Combinatorics (51144)