Norman Do: A tourist’s guide to topological recursion

A tourist’s guide to topological recursion Norman Do, Monash University, Avstralija Consider the enumeration of graphs on surfaces and the enumeration of permutation factorisations. Although seemingly distinct problems, they are both governed by a remarkable mathematical structure known as topological recursion, which emerged in the mathematical physics literature fifteen years ago. It has since become a unifying framework that connects diverse parts of mathematics, including: matrix models, quantum knot invariants, moduli spaces of curves, topological string theory and more. The goal of this talk is to use some interesting toy examples to uncover general features of the topological recursion.