Search arXivSearch

arXiv · 2311.06316

Hurwitz numbers with completed cycles and Gromov--Witten theory relative to at most three points

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 $2$-cycles. Okounkov and Pandharipande have established the remarkable GW/H correspondence, saying that the stationary sectors of the Gromov--Witten theory relative to $r$ points equal Hurwitz numbers with $r$ 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 $r\leq 2$. It is hard to obtain explicit formulas and then discuss the structural properties for the cases $r>2$. In this paper, we obtain explicit formulas for the case $r=3$ 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 completed cycles in addition to the parts of the profiles of branch points as usual, we show that certain hook-shape Hurwitz numbers are building blocks of all our Hurwitz numbers, and we prove an analogue of the celebrated $λ_g$-conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ricky X. F. Chen, Zhen-Ran Wang. 2023-11-10. Hurwitz numbers with completed cycles and Gromov--Witten theory relative to at most three points. https://arxiv.org/abs/2311.06316

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO