Skip to main content

Effective Riemann mappings of multiply connected domains and Riemann surfaces

  • ROBERT RETTINGER (a1) (a2)

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.

Hide All
Abikoff, W. (1981). The uniformization theorem. The American Mathemtical Monthly 88 (8) 574592.
Ahlfors, L. (1979). Complex Analysis, 3rd ed. McGraw-Hill Science/Engineering/Math.
Andreev, V. and McNicholl, T. (2009). Computing conformal maps onto canonical slit domains. In: Proceedings of the 6th International Conference on Computability and Complexity in Analysis, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2536.
Binder, I., Braverman, M. and Yampolsky, M. (2007). On computational complexity of Riemann mapping. Arkiv for Matematik 45 (2) 221239.
Brattka, V. and Presser, G. (2003). Computability on subsets of metric spaces. Theoretical Computer Science 305 (1–3) 4376.
Galatolo, S., Hoyrup, M. and Rojas, C. (2011). Dynamics and abstract computability: Computing invariant measures. Discrete and Continuous Dynamical Systems 29 (1) 193212.
Henrici, P. (1986). Applied and Computational Complex Analysis, Vol. 3, Wiley Classics Library Series.
Hertling, P. (1999). An effective Riemann mapping theorem. Theoretical Computer Science 219 (1–2) 225265.
Müller, N. (1987). Uniform computational complexity of Taylor series. In: ICALP 87. Springer-Verlag Lecture Notes in Computer Science 267 435444.
Nehari, Z. (1952). Conformal Mapping, McGraw-Hill.
Rettinger, R. (2008). Lower bounds on the continuation of holomorphic functions. Electronic Notes in Theoretical Computer Science 221 207217.
Rettinger, R. and Weihrauch, K. (2013). Products of effective topological spaces and a uniformly computable Tychonoff Theorem. Logical Methods in Computer Science 9 (4) 414.
Weihrauch, K. (2000). Computable Analysis, Springer.
Weihrauch, K. (2008). The computable multi-functions on multi-represented sets are closed under programming. Journal of Universal Computer Science 14 (6) 801844.
Weihrauch, K. and Grubba, T. (2009). Elementary computational topology. Journal of Universal Computer Science 15 (6) 13811422.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 24 *
Loading metrics...

Abstract views

Total abstract views: 163 *
Loading metrics...

* Views captured on Cambridge Core between 23rd September 2016 - 22nd March 2018. This data will be updated every 24 hours.