Related papers: Bellman function sitting on a tree
In this article we use the Bellman function technique to characterize the measures for which the weighted Hardy's inequality holds on dyadic trees. We enunciate the (dual) Hardy's inequality over the dyadic tree and we use the associated…
Evaluation of the Bellman functions is a difficult task. The exact Bellman functions of the dyadic Carleson Embedding Theorem 1.1 and the dyadic maximal operators are obtained in [3] and [4]. Actually, the same Bellman functions also work…
We develop technical tools that enable the use of Bellman functions for BMO defined on $\alpha$-trees, which are structures that generalize dyadic lattices. As applications, we prove the integral John--Nirenberg inequality and an inequality…
A Bellman function approach to Fefferman's $H^1-BMO$ duality theorem is presented. One Bellman-type argument is used to handle two different one-dimensional cases, dyadic and continuous. An explicit estimate for the constant of embedding…
For p>1 we find the Bellman function of two variables associated with the dyadic maximal operator on Rn.Actually we do that in the more general setting of tree-like maximal operators.We provide a simple and elementary proof,different from…
Nicola Arcozzi, Pavel Mozolyako, Karl-Mikael Perfekt, and Giulia Sarfatti recently gave the proof of a bi-parameter Carleson embedding theorem. Their proof uses heavily the notion of capacity on bi-tree. In this note we give one more proof…
We precisely compute the Bellman function of two variables of the dyadic maximal operator in relation to Kolmogorov inequality. In this way we give an alternative proof of the results in [5].Additionally, we characterize the sequences of…
We give an alternative proof of a sharp generalization of an integral inequality for the dyadic maximal operator due to which the evaluation of the Bellman function of this operator with respect to two variables, is possible. This last…
Bicubic maps are in bijection with \beta(0,1)-trees. We introduce two new ways of decomposing \beta(0,1)-trees. Using this we define an endofunction on \beta(0,1)-trees, and thus also on bicubic maps. We show that this endofunction is in…
We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…
This paper presents a new proof of the results regarding the continuity of weighted estimates with respect to the characteristic of the weight. Here we first prove the result in the dyadic case which is "easier" and then by the use of the…
We prove a sharp integral inequality for the dyadic maximal operator due to which the evaluation of the Bellman function of this operator with respect to two variables is possible, as can be seen in [3]. Our inequality of interest is proved…
We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
In this paper, by constructing the weight functions, a global Carleman estimate for the Schrodinger equation on a tree is established, with a strong assumption on the solution. And the estimate is able to be applied to derive the Lipschitz…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
The number of unbalanced interior nodes of divide-and-conquer trees on $n$ leaves is known to form a sequence of dilations of the Takagi function on dyadic rationals. We use this fact to derive identities on the Takagi function and on the…
In this paper the Erdos-Rado theorem is generalized to the class of well founded trees.
In this article, we prove various properties of Calkin-Wilf tree. We also see how the Minkowski question mark function will act on Calkin-Wilf tree and its diagonals.
In this paper we estimate the tail of distribution (i.e., the measure of the set $\{f\ge x\}$) for those functions $f$ whose dyadic square function is bounded by a given constant. In particular we get a bit better estimate than the estimate…