Algebraic methods in random matrices and enumerative geometry
Bertrand Eynard, Nicolas Orantin
TL;DR
<3-5 sentence high-level summary>The paper surveys the symplectic invariant (Eynard–Orantin) framework for solving loop equations across matrix models and beyond, by associating to any regular spectral curve a hierarchy of invariants $F_g$ and correlators $\omega_n^{(g)}$ that are unified under symplectic transformations via a topological recursion. It develops the geometric toolkit (spectral curves, Bergmann kernels, Abel map, branch points, etc.), establishes key properties (homogeneity, modularity, integrability, Virasoro constraints, holomorphic anomaly), and links these invariants to matrix models (1- and 2-matrix, chains, external fields) as well as to problems in enumerative geometry and nonperturbative string theory. The work highlights deep connections to KP/Hirota integrability, Kontsevich-type structures, and BCOV-type holomorphic anomaly, and demonstrates broad applicability to maps enumeration, topological strings, and Brownian motion problems. Overall, it provides a comprehensive, broadly applicable toolkit for computing high-genus corrections and understanding the algebraic structure underlying diverse problems in mathematical physics.
Abstract
We review the method of symplectic invariants recently introduced to solve matrix models loop equations, and further extended beyond the context of matrix models. For any given spectral curve, one defined a sequence of differential forms, and a sequence of complex numbers Fg . We recall the definition of the invariants Fg, and we explain their main properties, in particular symplectic invariance, integrability, modularity,... Then, we give several example of applications, in particular matrix models, enumeration of discrete surfaces (maps), algebraic geometry and topological strings, non-intersecting brownian motions,...
