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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlfors, L.: Complex Analysis, 3rd edn. McGraw-Hill Science/Engineering/Math. (1979)
Binder, I., Braverman, M., Yampolsky, M.: On computational complexity of Riemann mapping. Arkiv for Matematik 45(2) (2007)
Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theoretical Computer Science 305, 43–76 (2003)
Galatolo, S., Hoyrup, M., Rojas, C.: Dynamics and abstract computability:computing invariant measures. Discrete Contin. Dyn. Sys. 29(1), 193–212 (2011)
Henrici, P.: Applied and computational complex analysis. Wiley Classics Library Series, vol. 3 (1986)
Hertling, P.: An effective Riemann mapping theorem. Theoretical Computer Science 219(1-2), 225–265 (1999)
Andreev, V., McNicholl, T.: Computing Conformal Maps onto Canonical Slit Domains. In: 6th Int’l Conf. on Computability and Complexity in Analysis. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
Müller, N.: Uniform Computational Complexity of Taylor series. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 435–444. Springer, Heidelberg (1987)
Nehari, Z.: Conformal mapping. McGraw-Hill, New York (1952)
Rettinger, R.: Lower Bounds on the Continuation of Holomorphic Functions. Electr. Notes Theor. Comput. Sci 221, 207–217 (2008)
Rettinger, R., Weihrauch, K.: Tychonoff for compact sets is computable (submitted)
Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
Weihrauch, K., Grubba, T.: Elementary Computational Topology. Journal of Universal Computer Science 15(6), 1381–1422 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rettinger, R. (2012). Compactness and the Effectivity of Uniformization. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-30870-3_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30869-7
Online ISBN: 978-3-642-30870-3
eBook Packages: Computer ScienceComputer Science (R0)