2000 character limit reached
Log-hyperconvexity index and Bergman kernel
Published 21 Jun 2022 in math.CV | (2206.10133v1)
Abstract: We obtain a quantitative estimate of Bergman distance when $\Omega \subset \mathbb{C}n$ is a bounded domain with log-hyperconvexity index $\alpha_l(\Omega)>\frac{n-1+\sqrt{(n-1)(n+3)}}{2}$, as well as the $A2(\log A)q$-integrability of the Bergman kernel $K_{\Omega}(\cdot, w)$ when $\alpha_l(\Omega)>0$.
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.