The simple complexity of a Riemann surface

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

\noindent Given a Riemann surface $M$, the \emph{complexity} of a branched cover of $M$ to the Riemann sphere $S^2$, of degree $d$ and with branching set of cardinality $n \geq 3$, is defined as $d$ times the hyperbolic area of the complement of its branching set in $S^2$. A branched cover $p \colon M \to S^2$ of degree $d$ is \emph{simple} if the cardinality of the pre-image $p^{-1}(y)$ is at least $d-1$ for all $y \in S^2$. The \emph{(simple) complexity} of $M$ is defined as the infimum of the complexities of all (simple) branched covers of $M$ to $S^2$. We prove that if $M$ is a closed, connected, orientable Riemann surface of genus $g \geq 1$, then: (1) its simple complexity equals $8\pi g$, and (2) its complexity equals $2\pi(m_{\text{min}}+2g-2)$, where $m_{\text{min}}$ is the minimum total length of a branch datum realizable by a branched cover $p \colon M \to S^2$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The simple complexity of a Riemann surface does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The simple complexity of a Riemann surface, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The simple complexity of a Riemann surface will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-199791

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.