Related papers: Bellman function sitting on a tree
A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…
The paper studies a PDE model for the growth of a tree stem or a vine, having the form of a differential inclusion with state constraints. The equations describe the elongation due to cell growth, and the response to gravity and to external…
We enlarge the area of applicability of the Bellman function method to estimates in the spirit of the John--Nirenberg inequality abandoning certain convexity assumptions. As an application, we consider a characteristic of a function that is…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…
We prove multi-parameter dyadic embedding theorem for Hardy operator on the multi-tree. We also show that for a large class of Dirichlet spaces in bi-disc and tri-disc this proves the embedding theorem of those Dirichlet spaces of…
We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…
A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…
In this note, we discuss a generalization of the well-known implicit function theorem to the time-delay case. We show that the latter problem is closely related to the bicausal changes of coordinates of time-delay systems. An iterative…
In this article we consider a class of state-dependent delay differential equations which is modelling the dynamics of the number of adult trees in forests. We prove the boundedness of solutions for a single species model as well as a…
We prove a sharp integral inequality for the dyadic maximal operator and give as an application another proof for the computation of its Bellman function of three variables.
Specification of the strongest possible Bell inequalities for arbitrarily complicated physical scenarios -- any number of observers choosing between any number of observables with any number of possible outcomes -- is currently an open…
In this note we give the formula for the Bellman function associated with the problem considered by B. Davis in \cite{Davis} in 1976. In this article the estimates of the type $\|Sf\|_p \le C_p \|f\|_p$, $p\ge 2$, were considered for the…
We give a characterization of equilibrium measures for $p$-capacities on the boundary of an infinite tree of arbitrary (finite) local degree. For $p=2$, this provides, in the special case of trees, a converse to a theorem of Benjamini and…
The Dynamic Programming approach allows to compute a feedback control for nonlinear problems, but suffers from the curse of dimensionality. The computation of the control relies on the resolution of a nonlinear PDE, the…
In [Decompositions and statistics for \beta(1,0)-trees and nonseparable permutations, Advances Appl. Math. 42 (2009) 313--328] we introduced an involution, h, on \beta(1,0)-trees. We neglected, however, to prove that h indeed is an…
We offer a solution to a functional equation using properties of the Mellin transform. A new criteria for the Riemann Hypothesis is offered as an application of our main result, through a functional relationship with the Riemann xi…
A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…
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…