Bertrand Eynard - Topological Recursion: a recursive way of counting surfaces 

Enumerating various kinds of surfaces is an important goal in combinatorics of maps, enumerative geometry, string theory, statistical physics, and other areas of mathematics or theoretical physics. For example the famous Mirzakhani's recursion is about enumerating hyperbolic surfaces. It is often easier to enumerate planar surfaces, with the lowest topologies (disc, cylinder), and the question is how to enumerate surfaces of higher genus and with more boundaries. Many of the surface enumeration problems, satisfy a universal recursion, known as the "topological recursion", which, from the enumeration of discs and cylinders, gives all the other topologies. Moreover this recursion has many beautiful mathematical properties by itself, and allows to make the link with other areas of mathematics and physics, in particular integrable systems, random matrices, and many others.
Bertrand Eynard (Institut de physique théorique, CEA Saclay)
===
Find this and many more scientific videos on www.carmin.tv/ - a French video platform for mathematics and their interactions with other sciences offering extra functionalities tailored to meet the needs of the research community.
===