Related papers: Ces\`{a}ro Operators on Rooted Directed Trees
We show that for every graph $H$, there is a hereditary weakly sparse graph class $\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\mathcal C_H$ have bounded treewidth.…
It is well known that the generalized Ces\`aro matrices of order one are hyponormal operators on $\ell^2$, and it has recently been shown that the Ces\`aro matrix of order two is also hyponormal. Here the relatively new concept of…
In this paper we study a family of algorithms, introduced by Chan [SODA 1999] and called LR-algorithms, for drawing ordered rooted binary trees. In particular, we are interested in constructing LR-drawings (that are drawings obtained via…
There is no supercyclic power bounded operator of class $C_{1{\textstyle\cdot}}.$ There exist, however, weakly l-sequentially supercyclic unitary operators$.$ We show that if $T$ is a weakly l-sequentially supercyclic power bounded operator…
In this paper, we derive the sharp improved versions of Bohr-type inequalities for the Ces\'aro operator acting on the class of bounded analytic functions defined on the unit disk $\D=\left\{z\in\C:\left|z\right|<1\right\}$. In order to…
A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…
For p-subordinate perturbations of unbounded normal operators, the change of the spectrum is studied and spectral criteria for the existence of a Riesz basis with parentheses of root vectors are established. A Riesz basis without…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…
Centered weighted composition operators on $L^2$-spaces are characterized. The characterization is obtained without the assumption that the operator is a product of a multiplication and a composition operator. The concept of spectrally…
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 (MSO_2) is fixed-parameter tractable (fpt) on C by linear time parameterized algorithms,…
We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…
Let $\mathcal{L}$ be the space of complex-valued functions $f$ on the set of vertices $T$ of an rooted infinite tree rooted at $o$ such that the difference of the values of $f$ at neighboring vertices remains bounded throughout the tree,…
In this paper, we introduce a discrete analogue of weighted Hardy spaces on rooted trees and study weighted composition operators between them in detail. In particular, we characterize bounded and compact weighted composition operators…
For a digraph $D=(V(D), A(D))$, and a set $S\subseteq V(D)$ with $r\in S$ and $|S|\geq 2$, an $(S, r)$-tree is an out-tree $T$ rooted at $r$ with $S\subseteq V(T)$. Two $(S, r)$-trees $T_1$ and $T_2$ are said to be arc-disjoint if…
The celebrated Erd\H{o}s-P\'{o}sa Theorem, in one formulation, asserts that for every $c\geq 1$, graphs with no subgraph (or equivalently, minor) isomorphic to the disjoint union of $c$ cycles have bounded treewidth. What can we say about…
Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…
A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Elizalde, Roby, Plante and Sagan considered rowmotion on fences…
We construct continuous (and even invertible) linear operators acting on Banach (even Hilbert) spaces whose restrictions to their respective closed linear subspaces of chain recurrent vectors are not chain recurrent operators. This…
Let $\mathbb{D}$ denote the unit disc in $\mathbb{C}$. We define the generalized Ces\`aro operator as follows $$ C_{\omega}(f)(z)=\int_0^1 f(tz)\left(\frac{1}{z}\int_0^z B^{\omega}_t(u)\,du\right)\,\omega(t)dt,$$ where…