Acerca de este Curso
4.6
55 calificaciones
22 revisiones
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....
Globe

Cursos 100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Calendar

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.
Intermediate Level

Nivel intermedio

Clock

Approx. 34 hours to complete

Sugerido: 8 weeks, 10-12 hours per week...
Comment Dots

English

Subtítulos: English...
Globe

Cursos 100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Calendar

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.
Intermediate Level

Nivel intermedio

Clock

Approx. 34 hours to complete

Sugerido: 8 weeks, 10-12 hours per week...
Comment Dots

English

Subtítulos: English...

Programa - Qué aprenderás en este curso

Week
1
Clock
11 horas para completar

Introduction

...
Reading
1 video (Total: 8 min), 4 readings
Video1 video
Reading4 lecturas
Course Overview10m
Grading and Logistics10m
Suggested Readingsm
About the Instructor10m
Clock
11 horas para completar

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....
Reading
7 videos (Total: 78 min), 1 quiz
Video7 videos
Permutations10m
k-permutations8m
Merry-go-rounds and Fermat’s little theorem 18m
Merry-go-rounds and Fermat’s little theorem 211m
Binomial coefficients14m
The Pascal triangle16m
Quiz1 ejercicio de práctica
Quiz 2m
Week
2
Clock
11 horas para completar

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)....
Reading
7 videos (Total: 87 min), 1 quiz
Video7 videos
Balls in boxes and multisets 110m
Balls in boxes and multisets 26m
Integer compositions11m
Principle of inclusion and exclusion: two examples12m
Principle of inclusion and exclusion: general statement9m
The derangement problem19m
Quiz1 ejercicio de práctica
Quiz 3m
Week
3
Clock
14 horas para completar

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....
Reading
11 videos (Total: 105 min), 1 reading, 1 quiz
Video11 videos
Fibonacci numbers and the Pascal triangle7m
Domino tilings8m
Vending machine problem10m
Linear recurrence relations: definition7m
The characteristic equation8m
Linear recurrence relations of order 211m
The Binet formula11m
Sidebar: the golden ratio9m
Linear recurrence relations of arbitrary order8m
The case of roots with multiplicities12m
Reading1 lectura
Spoilers! Solutions for quizzes 2, 3, and 4.m
Quiz1 ejercicio de práctica
Quiz 4m
Week
4
Clock
13 horas para completar

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....
Reading
7 videos (Total: 73 min), 1 reading, 1 quiz
Video7 videos
Recurrence relation for triangulations11m
The cashier problem9m
Dyck paths5m
Recurrence relations for Dyck paths9m
Reflection trick and a formula for Catalan numbers12m
Binary trees15m
Reading1 lectura
Solutions10m
4.6

Principales revisiones

por RAMar 30th 2018

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.

por RRAug 22nd 2017

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

Instructor

Evgeny Smirnov

Associate Professor
Faculty of Mathematics

Acerca de 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 communications, IT, mathematics, engineering, and more. Learn more on www.hse.ru...

Preguntas Frecuentes

  • Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

  • Cuando compras un Certificado, obtienes acceso a todos los materiales del curso, incluidas las tareas calificadas. Una vez que completes el curso, se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes participar del curso como oyente sin costo.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.