A universal formula for the $x-y$ swap in topological recursion
Alexander Alexandrov, Boris Bychkov, Petr Dunin-Barkowski, Maxim Kazarian, Sergey Shadrin
TL;DR
This work establishes and proves a universal algebraic mechanism for the x–y swap in topological recursion, expressing swapped higher-point differentials $oldsymbol{ me}^{(g)}_{0,n}$ in terms of the original TR data $oldsymbol{ me}^{(g)}_{m,0}$ through universal graph-based expressions, vertex-operator contractions, and mixed correlators. It presents two equivalent formulations of the swap, shows their equivalence, and proves that the swapped correlators satisfy the same topological recursion when the original data do, thereby furnishing a complete duality framework. The authors also provide a simplified, shift-invariant form of the swap, extend the formalism to mixed $(m,n)$-points, and develop higher loop equations that underpin the duality; these results yield explicit closed formulas in important cases (e.g., $y(z)=z$) and recover notable instances such as Witten–Kontsevich. Collectively, the paper delivers a universal toolbox for translating TR outputs across x–y duality, with broad implications for matrix models, enumerative geometry, and related integrable systems. The methods combine Fock-space vertex operator techniques, graph-sum constructions, and a rigorous analysis of poles and loop equations to achieve computationally tractable, genus-aware dual formulas.
Abstract
We prove a recent conjecture of Borot et al. that a particular universal closed algebraic formula recovers the correlation differentials of topological recursion after the swap of $x$ and $y$ in the input data. We also show that this universal formula can be drastically simplified (as it was already done by Hock). As an application of this general $x-y$ swap result, we prove an explicit closed formula for the topological recursion differentials for the case of any spectral curve with unramified $y$ and arbitrary rational $x$.
