Skip to main content
Conference Proceedings

Compactness and the effectivity of uniformization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7318 LNCS 616-625
DOI: 10.1007/978-3-642-30870-3_62
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give new proofs of effective versions of the Riemann mapping theorem, its extension to multiply connected domains and the uniformization on Riemann surfaces. Astonishingly, in the presented proofs we need barely more than computational compactness and the classical results. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Rettinger, R. (2012). Compactness and the effectivity of uniformization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 616–625). https://doi.org/10.1007/978-3-642-30870-3_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free