On the corona problem for strongly pseudoconvex domains (Q2678418)

From MaRDI portal
Revision as of 08:28, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the corona problem for strongly pseudoconvex domains
scientific article

    Statements

    On the corona problem for strongly pseudoconvex domains (English)
    0 references
    0 references
    23 January 2023
    0 references
    The author studies the corona problem on domains where the \(\overline{\partial}\)-equation can be solved with uniform bounds. This class includes for example strictly pseudoconvex domains. The main result is that on such a domain, if the sublevel sets of the corona data have have closures (in \(\mathbb{C}^n\) !) whose intersection is empty, then the corona problem has a solution. This extends a result of \textit{S. G. Krantz} [Proc. Am. Math. Soc. 138, No. 10, 3651--3655 (2010; Zbl 1204.32004)] that treated this setup with two pieces of data. Both papers use the Koszul complex associated to the corona data, combined with \(\overline{\partial}\)-techniques.
    0 references
    corona problem
    0 references
    strictly pseudoconvex domains
    0 references
    Koszul complex
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references