The simple complexity of a Riemann surface
Abstract
Given a Riemann surface M, the complexity of a branched cover of M to the Riemann sphere S2, of degree d and with branching set of cardinality n ≥ 3, is defined as d times the hyperbolic area of the complement of its branching set in S2. A branched cover p M S2 of degree d is simple if the cardinality of the pre-image p-1(y) is at least d-1 for all y ∈ S2. The (simple) complexity of M is defined as the infimum of the complexities of all (simple) branched covers of M to S2. We prove that if M is a closed, connected, orientable Riemann surface of genus g ≥ 1, then: (1) its simple complexity equals 8π g, and (2) its complexity equals 2π(mmin+2g-2), where mmin is the minimum total length of a branch datum realizable by a branched cover p M S2.
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.