• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
2023/2024

Introduction to Topological Recursion

Type: Optional course (faculty)
When: 1, 2 module
Open to: students of all HSE University campuses
Language: English
ECTS credits: 6
Contact hours: 60

Course Syllabus

Abstract

Topological recursion (TR) is a remarkable universal recursive procedure that has been found in many enumerative geometry problems, from combinatorics of maps, to random matrices, Gromov-Witten invariants, Hurwitz numbers, knot polynomials and integrable systems. We start with TR in the theory of matrix models and through the bunch of examples come to the current understanding of TR in the theory of generalized Hurwitz numbers. We will discuss connections of TR with integrable hierarchies and embedded graphs. If time permits we consider examples and applications of TR in cohomology field theories.