111
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

On a generalized Forelli–Rudin construction

&
Pages 277-294 | Received 18 Feb 2005, Accepted 17 Nov 2005, Published online: 20 Aug 2006
 

Abstract

We generalize the classical construction of Forelli, Rudin and Ligocka, expressing the Bergman kernel of a Hartogs domain in terms of weighted Bergman kernels on its base, to the situation when the “fiber” of the Hartogs domain is, instead of the disc or the ball, an arbitrary irreducible bounded symmetric domain.

Acknowledgements

This article was written while the first author was visiting the second; it is a pleasant duty for him to thank the Chalmers Tekniska Högskola and Göteborg University for their hospitality and support. The authors also thank the referee for pointing out several misprints and inaccuracies in the first version of this article.

The research of the first author was supported by GA AV ČR grant no. A1019304 and the research of the second author was supported by the Swedish Science Council (VR).

Notes

1 The hypothesis of irreducibility is unessential and is made only for the sake of simplicity.

2 The support of dσ is actually a fairly small subset of ∂Ω F , related to the Shilov boundary of F.

3 The polynomials Ψ j ;ν coincide, up to a constant factor of jν j , with the Jack symmetric polynomials ; see Citation4, p. 378 and Example 1 on p. 383.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.