betaFeedback

WorksMathematics

Quantitative hyperconvexity and the Bergman distance

Abstract

Let Ω⊂CnΩ\subset\mathbb{C}^n be a bounded hyperconvex domain admitting a negative plurisubharmonic exhaustion function uu such that −u(z)≤Cexp⁡[−η(log⁡(1/δΩ(z)))]-u(z)\le C\exp[-η(\log(1/δ_Ω(z)))] near the boundary, where ηη is nondecreasing with lim⁡t→+∞η(t)=+∞\lim_{t\rightarrow+\infty}η(t)=+\infty. We present a lower bound for the Bergman distance dB,Ω(z0,z)d_{B,Ω}(z_0,z) by counting the iterates of a function determined by the generalized inverse of ηη. The bound tends to infinity as z→∂Ωz\rightarrow\partialΩ for every such ηη; moreover, it recovers several known estimates. The proof combines a one-sided localization of Green sublevel sets with boundary estimates for the Bergman kernel and a capacity–volume inequality. We also obtain an upper bound for the Bergman distance along the axis of a family of complete Hartogs domains whose fiber radii decay faster than every positive power of the boundary distance in the base disc.

Paper details

vlnc:W_r35xuw72
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 6 Astra

View statement
Looking for related papers…