Introduction to Enumerative Combinatorics

О курсе

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. The course is mostly self-contained. However, some acquaintance with basic linear algebra and analysis (including Taylor series expansion) may be very helpful.

О преподавателях

Evgeny SmirnovAssociate Professor, Faculty of Mathematics HSE

Входные требования

This course is primarily aimed at the Master of Science students of Mathematics department. Students are expected to have knowledge of one-semester courses of advanced calculus and linear algebra.

Содержание курса

Профессии, специальности и направления подготовки	Все направления подготовки
Область деятельности	Все области деятельности
ID курса	d8cca471b85347fe9926ea3b2b6c1e60
К-во обучающихся на версии курса	0
Язык	Английский
Длительность	8 недель
Сертификат	Есть
Версия	2

Рецензии и оценки

Отсутствует текст отзыва.

Правообладатель

Платформа

Дата уточняется