Search arXivSearch

arXiv · 2409.06655

The structure of Hurwitz numbers with fixed ramification profile and varying genus

Abstract

In 1891, Hurwitz introduced the enumeration of genus $g$, degree $d$, branched covers of the Riemann sphere with simple ramification over prescribed points and no branching elsewhere. He showed that for fixed degree $d$, the enumeration possesses a remarkable structure. More precisely, it can be expressed as a linear combination of exponentials $m^{2g-2+2d}$, where $m$ ranges over the integers from $1$ to $\binom{d}{2}$. In this paper, we generalise this structural result to Hurwitz numbers that enumerate branched covers which also have a prescribed ramification profile over one point. Our proof fundamentally uses the infinite wedge space, in particular the connected correlators of products of $\mathcal{E}$-operators. The recent study of Hurwitz numbers has often focussed on their structure with fixed genus and varying ramification profile. Our main result is orthogonal to this, allowing for the explicit calculation and the asymptotic analysis of Hurwitz numbers in large genus. We pose the broad question of which other enumerative problems exhibit analogous structure. We prove that orbifold Hurwitz numbers can also be expressed as a linear combination of exponentials and conjecture that monotone Hurwitz numbers share a similar structure, but with the inclusion of an additional linear term.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Norman Do, Jian He, Heath Robertson. 2024-09-10. The structure of Hurwitz numbers with fixed ramification profile and varying genus. https://arxiv.org/abs/2409.06655

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO