2000 character limit reached
On the completeness of a metric related to the Bergman metric
Published 8 Oct 2012 in math.CV | (1210.2372v1)
Abstract: We study the completeness of a metric which is related to the Bergman metric of a bounded domain. We provide a criterion for its completeness in the spirit of the Kobayashi criterion for the completeness of the Bergman metric. In particular we prove that in hyperconvex domains our metric is complete.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.