Topological recursion, symplectic duality, and generalized fully simple maps
Alexander Alexandrov, Boris Bychkov, Petr Dunin-Barkowski, Maxim Kazarian, Sergey Shadrin
TL;DR
The paper develops a broad framework connecting topological recursion on different spectral curves via a $\psi$-dependent symplectic duality, providing an explicit universal formula that expresses dual $n$-point functions in terms of the original TR data and vice versa. By constructing a large class of dual spectral curves and proving that the resulting $0,n$-point functions satisfy the loop equations and projection property on the dual curve, the authors show that generalized fully simple maps also satisfy topological recursion. The results generalize prior duality formulas and establish TR for generalized fully simple maps as a corollary, reinforcing a deep link between dual spectral-data and enumerative geometries encoded by Fock-space correlators. This duality offers a powerful tool for identifying TR structures in new combinatorial and geometric settings and for verifying TR when an explicit duality relation is known. The work thus broadens the scope of TR applicability and provides concrete, checkable formulas for translating TR data across dual spectral curves with potential applications in knot invariants and related combinatorial theories.
Abstract
For a given spectral curve, we construct a family of symplectic dual spectral curves for which we prove an explicit formula expressing the $n$-point functions produced by the topological recursion on these curves via the $n$-point functions on the original curve. As a corollary, we prove topological recursion for the generalized fully simple maps generating functions.
