The simple complexity of a Riemann surface
arXiv:1110.6453
Abstract
\noindent Given a Riemann surface , the \emph{complexity} of a branched cover of to the Riemann sphere , of degree and with branching set of cardinality , is defined as times the hyperbolic area of the complement of its branching set in . A branched cover of degree is \emph{simple} if the cardinality of the pre-image is at least for all . The \emph{(simple) complexity} of is defined as the infimum of the complexities of all (simple) branched covers of to . We prove that if is a closed, connected, orientable Riemann surface of genus , then: (1) its simple complexity equals , and (2) its complexity equals , where is the minimum total length of a branch datum realizable by a branched cover .
9 pages