pith. sign in

arxiv: 1903.02478 · v3 · pith:4J7DOCG7new · submitted 2019-03-06 · 🧮 math.CA · math.AP

A comparison of box and Carleson conditions on bi-trees

classification 🧮 math.CA math.AP
keywords conditioncarlesonbi-parametercertaincounterexampleembeddingsatisfyingsimple
0
0 comments X
read the original abstract

In this note we give an example of measure satisfying the box condition on certain sub-bi-trees (see below) but not satisfying Carleson condition on those sub-bi-trees. This can be considered as a certain counterexample for two weight bi-parameter embedding of Carleson type. Our type of counterexample is impossible for a simple tree. In the case of a simple tree, the box condition, Carleson condition and two weight embedding are all equivalent. In the last section we show that bi-parameter box condition implies the bi-parameter capacitary estimate for dyadic rectangles.

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.