×

zbMATH — the first resource for mathematics

The 1-convex generalization of Grauert’s direct image theorem. (English) Zbl 0197.36101

PDF BibTeX XML Cite
Full Text: DOI EuDML
References:
[1] Andreotti, A., Grauert, H.: Théorèmes de finitude pour la cohomologie des espaces complexes. Bull. Soc. Math. France90, 193-259 (1962). · Zbl 0106.05501
[2] Grauert, H.: Ein Theorem der analytischen Garbentheorie und die Modulräume komplexer Strukturen. I.H.E.S. No.5 (1960). Berichtigung. I.H.E.S. No.16, 35-36 (1963). · Zbl 0158.32901
[3] ?? The coherence of direct images. L’Enseignement mathématique16, 99-119 (1968). · Zbl 0164.09501
[4] Gunning, R. C., Rossi, H.: Analytic Functions of Several Complex Variables. Englewood Cliffs, N.J.: Prentice-Hall 1965. · Zbl 0141.08601
[5] Knorr, K.: Über den Grauertschen Kohärenzsatz bei eigentlichen holomorphen Abbildungen I, II. Ann. Scuola Norm. Sup. Pisa22, 729-761 (1968);23, 1-74 (1969). · Zbl 0177.34401
[6] Ling, H.-S.: Extending families for pseudoconcave spaces. Ph. D. Thesis, University of Notre Dame, Indiana, June 1970.
[7] Markoe, A., Rossi, H.: Families of strongly pseudoconvex manifolds. Proc. Conf. Several Complex Variables, Park City, Utah, 1970. · Zbl 0215.43201
[8] Siu, Y.-T.: Extending coherent analytic sheaves. Ann. of Math.90, 108-143 (1969). · Zbl 0181.36301 · doi:10.2307/1970684
[9] ?? A pseudoconcave generalization of Grauert’s direct image theorem: I, II. Ann. Scuola Norm. Sup. Pisa24, 278-330; 439-489 (1970).
[10] – Generalizations of Grauert’s direct image theorem. Proc. Conf. Several Complex Variables, Park City, Utah, 1970. · Zbl 0206.09104
[11] Wiegmann, K.-W.: Über Quotienten holomorph-konvexer komplexer Räume. Math. Z.97, 251-258 (1967). · Zbl 0148.32004 · doi:10.1007/BF01112168
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.