2000 character limit reached
Estimates for the Bergman Kernel and the Multidimensional Suita Conjecture
Published 30 Apr 2014 in math.CV | (1404.7692v1)
Abstract: We study the lower bound for the Bergman kernel in terms of volume of sublevel sets of the pluricomplex Green function. We show that it implies a bound in terms of volume of the Azukawa indicatrix which can be treated as a multidimensional version of the Suita conjecture. We also prove that the corresponding upper bound holds for convex domains and discuss it in bigger detail on some convex complex ellipsoids.
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.