Combinatorics and asymptotic behavior for double Hurwitz numbers

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Li, Xiang
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917445654020096
author Li, Xiang
author_facet Li, Xiang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_26323
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Combinatorics and asymptotic behavior for double Hurwitz numbers
Li, Xiang
Mathematical Physics
Combinatorics
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.
title Combinatorics and asymptotic behavior for double Hurwitz numbers
topic Mathematical Physics
Combinatorics
url https://arxiv.org/abs/2604.26323