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.

## Introduction to Enumerative Combinatorics

National Research University Higher School of Economics## About this Course

### Offered by

#### National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more.

## Syllabus - What you will learn from this course

**11 hours to complete**

## Introduction

**11 hours to complete**

**5 readings**

**11 hours to complete**

## Permutations and binomial coefficients

In this introductory lecture we discuss fundamental combinatorial constructions: we will see how to compute the number of words of fixed length in a given alphabet, the number of permutations of a finite set and the number of subsets with a given number of elements in a finite set. The latter numbers are called binomial coefficients; we will see how they appear in various combinatorial problems in this and forthcoming lectures. As an application of combinatorial methods, we also give a combinatorial proof of Fermat's little theorem.

**11 hours to complete**

**7 videos**

**1 practice exercise**

**12 hours to complete**

## Binomial coefficients, continued. Inclusion and exclusion formula.

In the first part of this lecture we will see more applications of binomial coefficients, in particular, their appearance in counting multisets. The second part is devoted to the principle of inclusion and exclusion: a technique which allows us to find the number of elements in the union of several sets, given the cardinalities of all of their intersections. We discuss its applications to various combinatorial problem, including the computation of the number of permutations without fixed points (the derangement problem).

**12 hours to complete**

**7 videos**

**1 practice exercise**

**14 hours to complete**

## Linear recurrences. The Fibonacci sequence

We start with a well-known "rabbit problem", which dates back to Fibonacci. Using the Fibonacci sequence as our main example, we discuss a general method of solving linear recurrences with constant coefficients.

**14 hours to complete**

**11 videos**

**1 reading**

**1 practice exercise**

**14 hours to complete**

## A nonlinear recurrence: many faces of Catalan numbers

In this lecture we introduce Catalan numbers and discuss several ways to define them: via triangulations of a polygon, Dyck paths and binary trees. We also prove an explicit formula for Catalan numbers.

**14 hours to complete**

**7 videos**

**2 readings**

## Reviews

### TOP REVIEWS FROM INTRODUCTION TO ENUMERATIVE COMBINATORICS

Excellent selection of material and presentation; TAs were of great help as well. The techniques taught in this course will be a nice addition to my algorithms analysis toolbox.

very nice course.very well taught by professor.one thing that can be improved is detailed solution of quizzes and assignments.thanks for the course:)

Great lectures and content. I really enjoyed it. However, the solutions exercises could be clearer and in more detail. Thank you!

Very good gourse, I persoally enjoyed the lectures in which the relatipnship with other areas of mathematics were discussed.

## Frequently Asked Questions

When will I have access to the lectures and assignments?

Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:

- The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
- The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

What will I get if I purchase the Certificate?

When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

What is the refund policy?

You will be eligible for a full refund until two weeks after your payment date, or (for courses that have just launched) until two weeks after the first session of the course begins, whichever is later. You cannot receive a refund once you’ve earned a Course Certificate, even if you complete the course within the two-week refund period. See our full refund policy.

Is financial aid available?

Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You’ll be prompted to complete an application and will be notified if you are approved. Learn more.

More questions? Visit the Learner Help Center.