Search arXivSearch

arXiv · 2408.10874

Hurwitz existence problem and fiber products

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fedor Pakovich. 2025-05-07. Hurwitz existence problem and fiber products. https://arxiv.org/abs/2408.10874

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

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT