Effective termination of Kohn's algorithm for subelliptic multipliers (Q541373)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Effective termination of Kohn's algorithm for subelliptic multipliers
scientific article

    Statements

    Effective termination of Kohn's algorithm for subelliptic multipliers (English)
    0 references
    0 references
    7 June 2011
    0 references
    In this very interesting and carefully written paper, the author discusses the problem of the effective termination of Kohn's algorithm for subelliptic multipliers for bounded smooth weakly pseudoconvex domains of finite type, introduced by \textit{J. J. Kohn} in [Acta Math. 142, 79--122 (1979; Zbl 0395.35069)]. The author gives here a complete proof of the effective termination of Kohn's algorithm for special domains, and gives directions on how the method is extended to the case of general bounded smooth weakly pseudoconvex domains of finite type. The termination of Kohn's algorithm in the real-analytic case was verified by \textit{K. Diederich} and \textit{J. E. Fornaess} [Ann. Math. (2) 107, 371--384 (1978; Zbl 0378.32014)] without effectiveness. In this paper, the author next formulates the Kohn algorithm geometrically in terms of the Frobenius theorem on integral submanifolds, and presents a proof of the real-analytic case of the ineffective termination of Kohn's algorightm from this geometric viewpoint. It is the author's hope that the geometric viewpoint developed in the paper will provide an easier and more transparent setting for further developments of the applications of algebraic-geometric techniques to general PDEs.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    subelliptic multipliers
    0 references
    Kohn's algorithm
    0 references
    complex Neumann problem
    0 references
    pseudoconvex domains
    0 references
    subelliptic estimates
    0 references
    finite type
    0 references
    multiplier ideal
    0 references
    0 references