Accessible Parts of Boundary for Simply Connected Domains
Pekka Koskela, Debanjan Nandi, Artur Nicolau

TL;DR
This paper provides a quantitative lower bound on the Hausdorff content of boundary parts accessible via John curves in simply connected domains, and applies this to weighted Hardy inequalities.
Contribution
It introduces a new lower bound for boundary accessibility in simply connected domains using John curves, extending Makarov's results with quantitative estimates.
Findings
Lower bound for Hausdorff content of accessible boundary parts
Identification of boundary intersection with John sub-domain boundary
Application to weighted Hardy inequalities
Abstract
For a bounded simply connected domain , any point and any , we give a lower bound for the -dimensional Hausdorff content of the set of points in the boundary of which can be joined to by a John curve with a suitable John constant depending only on , in terms of the distance of to . In fact this set in the boundary contains the intersection of the boundary of a John sub-domain of , centered at , with the boundary of . This may be understood as a quantitative version of a result of Makarov. This estimate is then applied to obtain the pointwise version of a weighted Hardy inequality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
