00:00:00 / 00:00:00

Topological Recursion: a recursive way of counting surfaces

By Bertrand Eynard

Appears in collection : Matrix Models for Quantum Systems – Special Day of the Seed Seminar of Mathematics and Physics

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.

Information about the video

  • Date of recording 07/06/2024
  • Date of publication 09/06/2024
  • Institution IHES
  • Language English
  • Audience Researchers
  • Format MP4

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback