Uniformization of planar domains by exhaustion
Abstract
We study the method of finding conformal maps onto circle domains by approximating with finitely connected subdomains. Every domain admits exhaustions, i.e., increasing sequences of finitely connected subdomains whose union is . By Koebe's theorem, each admits a conformal map from onto a circle domain . Assuming , our goal is to find out if is also a circle domain. We present a countably connected with an exhaustion so that has a limit whose image is not a circle domain, and a domain with an exhaustion so that has a limit whose image has uncountably many non-point complementary components. On the other hand, we prove that every exhaustion of a countably connected admits a refinement so that the image of the corresponding limit map is a circle domain. Our result extends the He-Schramm theorem on the uniformization of countably connected domains and provides a new proof.
Keywords
Cite
@article{arxiv.2111.00845,
title = {Uniformization of planar domains by exhaustion},
author = {Kai Rajala},
journal= {arXiv preprint arXiv:2111.00845},
year = {2021}
}