×

Harmonic functions expressible as Dirichlet solutions. (English) Zbl 0929.31002

Let \(R\) be a bounded domain in \(\mathbb{R}^d\), where \(d\geq 2\). Further, let \(H_{qb}(R)\) denote the collection of quasi-bounded harmonic functions on \(R\), and let \(H_{ds}(R)\) denote the collection of harmonic functions on \(R\) which are expressible as the Perron-Wiener-Brelot solution to the Dirichlet problem for some resolutive function on the Euclidean boundary. It is elementary to observe that \(H_{ds}(R) \subseteq H_{qb}(R)\) for any choice of \(R\), but the inclusion may be strict. (If, instead, the Martin boundary were used, then the two collections would always be equal.) This paper shows that \(H_{ds}(R)= H_{qb}(R)\) for a large class of domains \(R\) called the “continuous domains”. The precise definition of this concept is rather technical, but it covers star-shaped domains, Lipschitz domains and certain Hölder domains.

MSC:

31B10 Integral representations, integral operators, integral equations methods in higher dimensions
31B05 Harmonic, subharmonic, superharmonic functions in higher dimensions
31B20 Boundary value and inverse problems for harmonic functions in higher dimensions
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] C. CONSTANTINESCU UND A. CORNEA, Ideale Rander Riemannscher Flachen, Sponger, 1963. · Zbl 0112.30801
[2] L. L. HELMS, Introduction to Potential Theory, Wiley-Interscience, 1969 · Zbl 0188.17203
[3] Y. ISHIKAWA AND M. NAKAI, Regular and stable points in Dinchlet problem, Proc. Japa Acad. Ser. A Math. Sci., 73 (1997), 1-4. · Zbl 0873.31008
[4] L. SARIO AND M. NAKAI, Classification Theory of Riemann Surfaces, Springer, 1970 · Zbl 0199.40603
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.