arXiv · 2405.10720
Symplectic duality via log topological recursion
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 $x-y$ 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alexander Alexandrov, Boris Bychkov, Petr Dunin-Barkowski, Maxim Kazarian, Sergey Shadrin. 2024-05-17. Symplectic duality via log topological recursion. https://doi.org/10.4310/cntp.241203001416
Cite the original work for its findings. Save a collection to share your selection of sources.