Master
2024/2025
Introduction to Enumerative Combinatorics
Type:
Elective course (Mathematics)
Area of studies:
Mathematics
Delivered by:
Faculty of Mathematics
Where:
Faculty of Mathematics
When:
2 year, 1, 2 module
Mode of studies:
distance learning
Online hours:
111
Open to:
students of one campus
Instructors:
Pavel Semenov
Master’s programme:
Mathematics
Language:
English
ECTS credits:
6
Course Syllabus
Abstract
Enumerative combinatorics deals with finite sets and their cardinalities. In other words, a typical problem of enumerative combinatorics is to find the number of ways a certain pattern can be formed. In the first part of our course we will be dealing with elementary combinatorial objects and notions: permutations, combinations, compositions, Fibonacci and Catalan numbers etc. In the second part of the course we introduce the notion of generating functions and use it to study recurrence relations and partition numbers