Dyadic decomposition of convex domains of finite type and applications

preprint2020arXivOpen access

Abstract

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 PP on such domains with respect to Muckenhoupt weights. In particular, this result gives an alternative proof of the LpL^p boundedness of PP. Moreover, using extrapolation, we are also able to derive weighted vector-valued estimates and weighted modular inequalities for the Bergman projection.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.