Vanishing $H^1$ for Hurwitz spaces of fully-marked admissible covers of degree 3
Amy Q. Li
TL;DR
This work proves the vanishing of $H^1$ for the Hurwitz spaces of fully-marked admissible covers of degree $3$, and deduces the same for the classical simply-branched Hurwitz spaces, while showing nonvanishing in degree $4$ via explicit 1-dimensional base cases. The authors develop an inductive framework that leverages the boundary stratification and a monodromy-centric encoding of covers, using a natural target map to $\overline{\mathcal{M}}_{0,m}$ to reduce genus computations to monodromy data and the Riemann–Hurwitz formula, aided by a Python tool for base-case calculations. This approach mirrors Arbarello–Cornalba’s method for moduli of curves, yet adapts it to Hurwitz spaces by analyzing boundary strata that involve generalized admissible covers. The paper provides concrete base-case data up to degree $5$, establishing vanishing for $d=3$ and demonstrating nonvanishing phenomena for $d\ge 4$, which has implications for the Picard Rank Conjecture and the odd-cohomology program in Hurwitz spaces.
Abstract
We show that the first cohomology group of the Hurwitz space of fully-marked admissible covers $H^1(\overline{\mathcal{H}}_{\underline{d},\underline{g}}(\underlineμ))$ vanishes for covers of degree $ d = 3$ and deduce the same result for the classical Hurwitz space of simply-branched covers. In degree 4, we compute examples where $H^1(\overline{\mathcal{H}}_{\underline{4},\underline{g}}(\underlineμ))$ is nonzero, which implies that $H^1(\overline{\mathcal{H}}_{\underline{d},\underline{g}}(\underlineμ))$ is nonvanishing for $d \geq 4$. We describe the stratification of the boundary of $\overline{\mathcal{H}}_{\underline{d},\underline{g}}(\underlineμ)$ by lower-dimensional $\overline{\mathcal{H}}_{\underline{d'},\underline{g'}}(\underline{μ'})$, and set up an inductive framework which may be used for future arguments involving the odd cohomology of $\overline{\mathcal{H}}_{\underline{d},\underline{g}}(\underlineμ)$.
