arXiv:2001.07200 [math.CA]AbstractReferencesReviewsResources
Dyadic decomposition of convex domains of finite type and applications
Chun Gan, Bingyang Hu, Ilyas Khan
Published 2020-01-20Version 1
In this paper, we introduce a dyadic structure on convex domains of finite type via the so-called dyadic flow tents. This dyadic structure allows us to establish weighted norm estimates for the Bergman projection $P$ on such domains with respect to Muckenhoupt weights. In particular, this result gives an alternative proof of the $L^p$ boundedness of $P$. Moreover, using extrapolation, we are also able to derive weighted vector-valued estimates and weighted modular inequalities for the Bergman projection.
Comments: 24 pages, 4 figures
Related articles: Most relevant | Search more
On $L^{p}$-improving bounds for maximal operators associated with curves of finite type in the plane
arXiv:1904.12262 [math.CA] (Published 2019-04-28)
The Fuglede conjecture for convex domains is true in all dimensions
arXiv:1508.04280 [math.CA] (Published 2015-08-18)
Multiplier transformations associated to convex domains in $\mathbb{R}^2$