Construction of labyrinths in pseudoconvex domains
Abstract
We build in a given pseudoconvex (Runge) domain D of C N an 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) → D with lim r→1 γ(r) ∈ ∂D and omitting Γ has infinite length. This solves a problem left open in a recent paper by Alarcón and Forstnerič.
Domains
Functional Analysis [math.FA]
Fichier principal
Charpentier-Kosinski-labyrinth-pseudoconvex-rev.pdf (285.01 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)