Almost Regular Coverings of the Sphere: Realizability. I. Tetrahedral Case
Abstract
We prove the realizability of genus-0 branch data of the form (2r,a | 3s,b | 3t,c) and (2r,a | 3s | 3t,b,c), where a, b, c are not divisible by 2, 3, 3 respectively. The proof uses an explicit combinatorial description of coverings of the sphere branched over 3 points via dessins d'enfants. As a corollary, we establish realizability for a broader class of branch data with more critical values.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.