Hurwitz existence problem and fiber products

TL;DR

This paper investigates the Hurwitz existence problem by analyzing fiber products of holomorphic maps, providing new non-realizability results for branch data, and connecting these findings to classical polynomial equations.

Contribution

It introduces a fiber product approach to explain non-realizability of branch data and constructs numerous new examples, extending classical results like Halphen's theorem.

Findings

Unified explanation for non-realizable branch data

Construction of many new non-realizable branch data cases

Derivation of Halphen's theorem on polynomial solutions

Abstract

With each holomorphic map $f: R \rightarrow \mathbb C\mathbb P^1$, where $R$ is a compact Riemann surface, one can associate a combinatorial datum consisting of the genus $g$ of $R$, the degree $n$ of $f$, the number $q$ of branching points of $f$, and the $q$ partitions of $n$ given by the local degrees of $f$ at the preimages of the branching points. These quantities are related by the Riemann-Hurwitz formula, and the Hurwitz existence problem asks whether a combinatorial datum that fits this formula actually corresponds to some map $f$. In this paper, using results and techniques related to fiber products of holomorphic maps between compact Riemann surfaces, we prove a number of results that enable us to uniformly explain the non-realizability of many previously known non-realizable branch data, and to construct a large amount of new such data. We also deduce from our results the theorem of Halphen, proven in 1880, concerning polynomial solutions of the equation $A(z)^a+B(z)^b=C(z)^c$, where $a,b,c$ are integers greater than one.