arXiv · 2604.26323
Combinatorics and asymptotic behavior for double Hurwitz numbers
Abstract
Polynomial-in-time algorithms for computing classical Hurwitz numbers were given in [4] based on the Pandharipande equation. The paritition function of double Hurwitz numbers was proved [21] to satisfy the 2-Toda hierarchy. In this paper, similar to [21] we derive Pandharipande-type equations for double Hurwitz numbers from 2-Toda hierarchy. Based on these equations and a method from [4], we study large genus as well as large degree asymptotics of double Hurwitz numbers.
Explore related subjects
Keep this discovery
Xiang Li. 2026-04-29. Combinatorics and asymptotic behavior for double Hurwitz numbers. https://arxiv.org/abs/2604.26323
Cite the original work for its findings. Save a collection to share your selection of sources.