American Institute of Mathematics, Palo Alto, California
Vincent Bouchard, Motohico Mulase, and Brad Safnuk
The recursion formula was originally discovered in Random Matrix Theory as a tool to compute the genus expansion of the free energy and the n-point correlation functions of resolvents. The recursion formula is entirely geometric, relying only on simple complex analysis of the complex resolvent set of the matrices known as the spectral curve.
One can however take an opposite point of view: Start with an arbitrary plane curve C, and apply the recursion to it, as an axiom. The topological recursion then produces an inﬁnite tower of meromorphic differentials of the curve C and symplectic invariants of the geometric data. The generating function of these quantities is always a tau-function of a KP-type integrable system. An obvious mathematical question arises: What is the recursion computing in this context? It turns out to have deep and unexpected interconnections with various areas of mathematics and physics, notably topological string theory and enumerative geometry.
When applied to their mirror curves, it has been conjectured that the recursion should govern open and closed Gromov-Witten theory on toric Calabi-Yau threefolds. When applied to the analytic curve which deﬁnes the Lambert W-function, the recursion computes generating functions of Hurwitz numbers. These exciting developments rely on physical insights, and cry for a mathematical explanation.
It is the aim of this workshop to lay down the mathematical foundations behind the appearance of the recursion in Gromov-Witten theory and topological string theory, which seem to involve new exciting interactions between geometry and integrable systems.
The workshop schedule.
A report on the workshop activities.
A list of open problems.