On Bergman completeness of pseudoconvex Reinhardt domains (Q1576425): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:27, 1 February 2024

scientific article
Language Label Description Also known as
English
On Bergman completeness of pseudoconvex Reinhardt domains
scientific article

    Statements

    On Bergman completeness of pseudoconvex Reinhardt domains (English)
    0 references
    21 June 2001
    0 references
    It is well-known that any bounded hyperconvex domain \(D\) in \({\mathbb C}^n\) is Bergman complete [\textit{Z. Błocki} and \textit{P. Pflug}, Nagoya Math. J. 151, 221-225 (1998; Zbl 0916.32016) and \textit{G. Herbort}, Math. Z. 232, 183-196 (1999; Zbl 0933.32048)]. The paper under review now gives a precise description of those bounded pseudoconvex Reinhardt domains that are Bergman complete. To be more precise: Let \(D\) be a bounded pseudoconvex Reinhardt domain in \({\mathbb C}^n\) and let \(a\in \log D\). Put \({\mathcal C}(D) := \{ v\in {\mathbb R}^n: a + {\mathbb R}_+ v \subset \log D\}\) and \(\tilde{{\mathcal C}}(D) := \{ v \in {\mathcal C} (D) : \overline{\exp (a+ {\mathbb R}_+ v\}} \subset D\}\). Then the result is the following: \(D\) is Bergman complete iff \(({\mathcal C}(D) \setminus \tilde{{\mathcal C}} (D)) \cap {\mathbb Q}^n = \emptyset\). Using this geometric criterion delivers plenty of Bergman complete domains that are not hyperconvex.
    0 references
    0 references
    Bergman complete
    0 references
    bounded pseudoconvex Reinhardt domain
    0 references

    Identifiers