Hurwitz numbers with completed cycles and Gromov--Witten theory relative to at most three points
Ricky X. F. Chen, Zhen-Ran Wang

TL;DR
This paper derives explicit formulas and structural properties for Hurwitz numbers with completed cycles relative to three points, extending computational understanding beyond previously known cases and revealing new polynomiality and combinatorial features.
Contribution
It provides the first explicit formulas for Hurwitz numbers with completed cycles relative to three points and uncovers their structural properties, including piecewise polynomiality and foundational building blocks.
Findings
Explicit formulas for r=3 case
Piecewise polynomiality in cycle orders and profiles
Hook-shaped Hurwitz numbers as building blocks
Abstract
Hurwitz numbers with completed cycles are standard Hurwitz numbers with simple branch points replaced by completed cycles. In fact, simple branch points correspond to completed -cycles. Okounkov and Pandharipande have established the remarkable GW/H correspondence, saying that the stationary sectors of the Gromov--Witten theory relative to points equal Hurwitz numbers with branch points besides the completed cycles. However, from the viewpoint of computation, known results for Hurwitz numbers (standard or with completed cycles) are mainly for . It is hard to obtain explicit formulas and then discuss the structural properties for the cases . In this paper, we obtain explicit formulas for the case and uncover a number of structural properties of these Hurwitz numbers. For instance, we discover a piecewise polynomiality with respect to the orders of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Advanced Combinatorial Mathematics · Algebraic structures and combinatorial models
