Symplectic duality via log topological recursion
arXiv:2405.10720 · doi:10.4310/CNTP.241203001416
Abstract
We review the notion of symplectic duality earlier introduced in the context of topological recursion. We show that the transformation of symplectic duality can be expressed as a composition of dualities in a broader context of log topological recursion. As a corollary, we establish nice properties of symplectic duality: various convenient explicit formulas, invertibility, group property, compatibility with topological recursion and KP integrability. As an application of these properties, we get a new and uniform proof of topological recursion for large families of weighted double Hurwitz numbers; this encompasses and significantly extends all previously known results on this matter.
33 pages, several corrections and clarifications added