×

On the multiplicative Cousin problem with bounded data. (English) Zbl 0261.32008


MSC:

32D99 Analytic continuation
PDF BibTeX XML Cite
Full Text: Numdam EuDML

References:

[1] 1 Aronszajn , N. , and K.T. Smith , Functional Spaces and Functional Completion , Ann. Inst. Fourier ( Grenoble ) VI ( 1955-56 ), 125 - 185 . Numdam | MR 80878 | Zbl 0071.33003 · Zbl 0071.33003
[2] 2 Dieudonne , J. , Foundations of Modern Analysis , Academic Press , New York , 1960 . MR 120319 | Zbl 0100.04201 · Zbl 0100.04201
[3] 3 Gamelin , T.W. , Uniform Algebras , Prentice-Hall , Englewood Cliffs , 1970 . MR 410387 | Zbl 0213.40401 · Zbl 0213.40401
[4] 4 Cunning , R.C. , and H. Rossi , Analytic Functions of Several Complex Variables , Prentice-Hall , Englewood Cliffs , 1965 . MR 180696 | Zbl 0141.08601 · Zbl 0141.08601
[5] 5 Hardy , G.H. , J.E. Littlewood , and G. Polva , Ineqiialities , 2 nd edition, Cambridge Univ. Press , London , 1959 . Zbl 0010.10703 · Zbl 0010.10703
[6] 6 Henkin , G.M. , Integral representations of functions holoniorphic in strictly pseudo-convex domains and some applications . Math. USSR Sbornik 7 ( 1969 ), 597 - 616 . ( Mat. Sbornik 78 ( 1969 )) MR 249660 | Zbl 0208.35102 · Zbl 0208.35102
[7] 7 Leray , J. , Le calcul différential et intégral sur une variété analytique complexe (Probl6me de Cauchy, III) , Bull. Soc. Math. France 87 ( 1959 ), 81 - 180 . Numdam | MR 125984 | Zbl 0199.41203 · Zbl 0199.41203
[8] 8 Lumer , G. , Éspaces de Hardy en plusieur variables complexes , to appear in the Comptes Btindu 8 ( Paris ). MR 282208 | Zbl 0216.16101 · Zbl 0216.16101
[9] 9 Stout E.L. , The Second Ceusin Problem with Bounded Data , Pacific J. Math , 26 ( 1968 ), 379 - 387 . Article | MR 235155 | Zbl 0183.35201 · Zbl 0183.35201
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.