Related papers: Ces\`{a}ro Operators on Rooted Directed Trees
A rooted tree $\vec{R}$ is a rooted subtree of a tree $T$ if the tree obtained by replacing the directed edges of $\vec{R}$ by undirected edges is a subtree of $T$. We study the problem of assigning minimum number of colors to a given set…
In this paper, we are mainly concerned with studying arbitrary unbounded square roots of linear operators as well as some of their basic properties. The paper contains many examples and counterexamples. As an illustration, we give explicit…
In this article, we prove the following spectral theorem for right linear normal operators (need not to be bounded) in quaternionic Hilbert spaces: Let $T$ be an unbounded right quaternionic linear normal operator in a quaternionic Hilbert…
For $p>\frac{2\lambda}{2\lambda+1}$ with $\lambda>0$, the Hardy spaces $H_{\lambda}^{p}(\mathbb{R}^{2}_+)$ associated with the Dunkl transform $\mathscr{F}_\lambda$ and the Dunkl operator $D_x$ on the line, where…
It is proved that each bounded injective bilateral weighted shift $W$ satisfying the equality $W^{*n}W^{n}=(W^{*}W)^{n}$ for some integer $n\geq 2$ is quasinormal. For any integer $n\geq 2$, an example of a bounded non-quasinormal weighted…
Given a bounded valence, bushy tree T, we prove that any cobounded quasi-action of a group G on T is quasiconjugate to an action of G on another bounded valence, bushy tree T'. This theorem has many applications: quasi-isometric rigidity…
Recently, continuous tensor functions have attracted increasing attention, because they can unifiedly represent data both on mesh grids and beyond mesh grids. However, since mode-$n$ product is essentially discrete and linear, the potential…
One of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic is fixed-parameter tractable on C by linear time parameterised algorithms. An immediate…
For the weight function $\prod_{i=1}^{d+1}|x_i|^{2\k_i}$ on the unit sphere, sharp local estimates of the orthogonal projection operators are obtained and used to prove the convergence of the Ces\`aro $(C,\delta)$ means in the weighted…
The Perron value $\rho(T)$ of a rooted tree $T$ has a central role in the study of the algebraic connectivity and characteristic set, and it can be considered a weight of spectral nature for $T$. A different, combinatorial weight notion for…
The weighted shifts are long known and important class of operators. One of known generalisation of this class are weighted shifts on directed trees, where we replace the linear order of coordinates in $\ell^2$ with a possibly more…
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…
In this work, we study the composition operators on the little Lipschitz space ${\mathcal L}_0$ of a rooted tree $T$, defined as the subspace of the Lipschitz space ${\mathcal L}$ consisting of the complex-valued functions $f$ on $T$ such…
In this article, we conduct a comprehensive study on the continuity, compactness, and spectral properties of Rhaly operators and generalized Ces\`aro operators, acting on weighted null sequence spaces. We determine the point spectrum,…
The notions of bounded expansion and nowhere denseness have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs. We show…
The generalized Ces\`{a}ro operators $\mathcal{C}_t$, for $t\in[0,1)$, introduced in the 1980's by Rhaly, are natural analogues of the classical Ces\`{a}ro averaging operator $\mathcal{C}_1$ and act in various Banach sequence spaces…
We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…
A zero-one sequence describes a path through a rooted directed binary tree $T$; it also encodes a real number in $[0,1]$. We regard the level of the external node of $T$ along the path as a function on the unit interval, the silhouette of…
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a rooted binary random tree $T_n$ with $n$ leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of…
Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree $S$…