Bellman function sitting on a tree
From MaRDI portal
Abstract: In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
Recommendations
- The Bellman functions of dyadic-like maximal operators and related inequalities
- Inequalities for BMO on -trees
- The Bellman function of the dyadic maximal operator in connection with the dyadic Carleson imbedding theorem
- Bellman Function and the H^1-BMO Duality
- Sharp general local estimates for dyadic-like maximal operators and related Bellman functions
Cited in
(3)
This page was built for publication: Bellman function sitting on a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028236)