Saint Petersburg Colloquium on Topological Recursion
Chebyshev Laboratory, SPbU, October 19-20, 2015
Topological recursion (also known as Eynard-Orantin, or Chekhov-Eynard-Orantin recursion) is a universal recursive formula that is applicable to a variety of enumerative problems in various areas of mathematics and mathematical physics. It is not just ubiquitous, but is also effective in the sense that it allows for an actual computation.
Topological recursion was initially derived as a recursion for the coefficients of asymptotic expansions in random matrix theory. However, it soon appeared to be useful for counting combinatorial objects of different nature (in particular, for computing Hurwitz numbers, Gromov-Witten invariants, volumes of moduli spaces, Jones polynomials and many more). It is also closely tied with quantum and cohomological field theories.
Тел.: (812) 363-68-71