Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-19T18:36:33.275Z Has data issue: false hasContentIssue false
  • English
  • Français

Effective Riemann mappings of multiply connected domains and Riemann surfaces

Published online by Cambridge University Press:  23 September 2016

ROBERT RETTINGER
ROBERT RETTINGER*
Affiliation:
Department of Computer Science, FernUniversität Hagen, Hagen, Germany Department of Computer Science, University of Applied Sciences and Arts, Dortmund, Germany Email: robert.rettinger@fh-dortmund.de
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Special Issue 8: Continuity, Computability, Constructivity: From Logic to Algorithms 2013 , December 2017 , pp. 1495 - 1520
Copyright
Copyright © Cambridge University Press 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abikoff, W. (1981). The uniformization theorem. The American Mathemtical Monthly 88 (8) 574–592.Google Scholar
Ahlfors, L. (1979). Complex Analysis, 3rd ed. McGraw-Hill Science/Engineering/Math.Google Scholar
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 25–36.Google Scholar
Binder, I., Braverman, M. and Yampolsky, M. (2007). On computational complexity of Riemann mapping. Arkiv for Matematik 45 (2) 221–239.Google Scholar
Brattka, V. and Presser, G. (2003). Computability on subsets of metric spaces. Theoretical Computer Science 305 (1–3) 43–76.Google Scholar
Galatolo, S., Hoyrup, M. and Rojas, C. (2011). Dynamics and abstract computability: Computing invariant measures. Discrete and Continuous Dynamical Systems 29 (1) 193–212.CrossRefGoogle Scholar
Henrici, P. (1986). Applied and Computational Complex Analysis, Vol. 3, Wiley Classics Library Series.Google Scholar
Hertling, P. (1999). An effective Riemann mapping theorem. Theoretical Computer Science 219 (1–2) 225–265.Google Scholar
Müller, N. (1987). Uniform computational complexity of Taylor series. In: ICALP 87. Springer-Verlag Lecture Notes in Computer Science 267 435–444.Google Scholar
Nehari, Z. (1952). Conformal Mapping, McGraw-Hill.Google Scholar
Rettinger, R. (2008). Lower bounds on the continuation of holomorphic functions. Electronic Notes in Theoretical Computer Science 221 207–217.Google Scholar
Rettinger, R. and Weihrauch, K. (2013). Products of effective topological spaces and a uniformly computable Tychonoff Theorem. Logical Methods in Computer Science 9 (4) 4–14.Google Scholar
Weihrauch, K. (2000). Computable Analysis, Springer.CrossRefGoogle Scholar
Weihrauch, K. (2008). The computable multi-functions on multi-represented sets are closed under programming. Journal of Universal Computer Science 14 (6) 801–844.Google Scholar
Weihrauch, K. and Grubba, T. (2009). Elementary computational topology. Journal of Universal Computer Science 15 (6) 1381–1422.Google Scholar