Derridj, Maklouf; Tartakoff, David S. On the global real analyticity of solutions to the \(\overline\partial\)- Neumann problem. (English) Zbl 0441.35049 Commun. Partial Differ. Equations 1, 401-435 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 25 Documents MSC: 35N15 \(\overline\partial\)-Neumann problems and formal complexes in context of PDEs 35B65 Smoothness and regularity of solutions to PDEs 32T99 Pseudoconvex domains 35B45 A priori estimates in context of PDEs Keywords:global real analyticity; strongly pseudoconvex open, relatively compact submanifold; Hermitian manifold; a priori estimate; Cauchy-Kovalevski theorem PDF BibTeX XML Cite \textit{M. Derridj} and \textit{D. S. Tartakoff}, Commun. Partial Differ. Equations 1, 401--435 (1976; Zbl 0441.35049) Full Text: DOI References: [1] Baouendi M.S, Symp. in Pure Math. 23 pp 79– (1971) · doi:10.1090/pspum/023/0352680 [2] Derridj M., Sur la Regularite G2 au Bord des Solutions du Probléme de Neumann Pour L’Opératcur [3] Folland G.E, Comm. Pure Appl. J. Math. pp 429– (1974) · Zbl 0293.35012 · doi:10.1002/cpa.3160270403 [4] Kohn J. J, Annals of Math 78 (1) pp 112– (1963) · Zbl 0161.09302 · doi:10.2307/1970506 [5] Kohn J.J, Trans. A.M.S. 181 pp 273– [6] Kohn J.J, Comm. Pure Appl, Math. 18 pp 443– (1965) · Zbl 0125.33302 · doi:10.1002/cpa.3160180305 [7] Moorey C.B, Comm. Pure Appl. Math. 19 pp 271– (1957) · Zbl 0082.09402 · doi:10.1002/cpa.3160100204 [8] Sato M, of Lecture Notes in Mathematics 287 (1973) [9] Tartakoff D.S, Comm. Pure Appl. Math 26 pp 251– (1973) · Zbl 0265.35023 · doi:10.1002/cpa.3160260302 [10] Tartakoff D.S, Communications in PDE’s (4) (1976) [11] Tréves F, Comm. Pure Appl. Math. 24 pp 537– (1971) · Zbl 0222.35014 · doi:10.1002/cpa.3160240407 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.