The uniform asymptotics for real double Hurwitz numbers with triple ramification (2303.03671v3)
Abstract: We consider the problem of counting real ramified coverings of the complex projective line $\mathbb{C}\mathbb{P}1$ by real Riemann surfaces of genus $g$, where the ramification profiles over $0$ and $\infty$ are $\lambda$ and $\mu$ respectively, and the ramification profiles over other real branch points consist of either $(3,1,\ldots,1)$ or $(2,1,\ldots,1)$. The solutions to this problem are called real double Hurwitz numbers with triple ramification and are denoted by $H{\mathbb{R}}g(\lambda,\mu;\Lambda-{s,t},\Lambda+_{s,t})$. We apply a modified version of the tropical computaton developed by Markwig and Rau for real Hurwitz numbers to compute $H{\mathbb{R}}g(\lambda,\mu;\Lambda-{s,t},\Lambda+_{s,t})$. Based on a generalization of Rau's zigzag number, we introduce a combinatorial invariant that serves as the lower bound for $H{\mathbb{R}}g(\lambda,\mu;\Lambda-{s,t},\Lambda+_{s,t})$. We obtain a uniform lower bound for the large degree and large genus logarithmic asymptotics of these combinatorial invariants. Our uniform lower bound implies the following results. (1). We establish a uniform lower bound for the large degree and large genus logarithmic asymptotics of $H{\mathbb{R}}g(\lambda,\mu;\Lambda-{s,t},\Lambda+_{s,t})$ and its complex counterparts. In particular, we give a partial answer to an open question proposed by Dubrovin, Yang and Zagier on the uniform bound for simple Hurwitz numbers. (2). We obtain the logarithmic equivalence between $H{\mathbb{R}}g(\lambda,\mu;\Lambda-{s,t},\Lambda+_{s,t})$ and its complex counterparts as the degree tends to infinity and only simple branch points are added. (3). As the genus tends to infinity and only simple branch points are added, we show that the logarithms of $H{\mathbb{R}}g(\lambda,\mu;\Lambda-{s,t},\Lambda+_{s,t})$ and its complex counterparts are of the same order.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.