pith. sign in

arxiv: 1809.03397 · v2 · pith:GYHGK7Z5new · submitted 2018-09-10 · 🧮 math.CA · math.AP· math.FA

Bellman function sitting on a tree

Nicola Arcozzi , Irina Holmes , Pavel Mozolyako , Alexander Volberg This is my paper
classification 🧮 math.CA math.APmath.FA
keywords bellmanfunctiontreeapproachbi-treecasecertainconsider
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Counterexamples for bi-parameter Carleson embedding

    math.AP 2019-06 unverdicted novelty 6.0

    Several counterexamples are built for the two-weight bi-parameter Carleson embedding theorem.