arXiv · 1907.02803
Construction of labyrinths in pseudoconvex domains
Abstract
We build in a given pseudoconvex (Runge) domain $D$ of $\mathbb{C}^N$ a $\mathcal O(D)$ convex set $Γ$, every connected component of which is a holomorphically contractible (convex) compact set, enjoying the property that any continuous path $γ:[0,1)\rightarrow D$ with $\lim _{r\rightarrow 1}γ(r)\in \partial D$ and omitting $Γ$ has infinite length. This solves a problem left open in a recent paper by Alarcón and Forstnerič.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Stéphane Charpentier, Łukasz Kosiński. 2019-07-05. Construction of labyrinths in pseudoconvex domains. https://arxiv.org/abs/1907.02803
Cite the original work for its findings. Save a collection to share your selection of sources.