Related papers: Hypercyclic algebras for weighted shifts on trees
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that $G$ admits a 0/1-weighting with the same property, or that…
We show that there exists an invertible frequently hypercyclic operator on $\ell^1(\mathbb{N})$ whose inverse is not frequently hypercyclic.
We study the weighted composition operators between the Lipschitz space and the space of bounded functions on the set of vertices of an infinite tree. We characterized the boundedness, the compactness, and the boundedness from below of…
We provide a sufficient condition for an operator $T$ on a non-metrizable and sequentially separable topological vector space $X$ to be sequentially hypercyclic. This condition is applied to some particular examples, namely, a composition…
Using {\it weighted traces} which are linear functionals of the type $$A\to tr^Q(A):=(tr(A Q^{-z})-z^{-1} tr(A Q^{-z}))_{z=0}$$ defined on the whole algebra of (classical) pseudo-differential operators (P.D.O.s) and where $Q$ is some…
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…
A ``Wick rotation'' is applied to the noncommutative sphere to produce a noncommutative version of the hyperboloids. A harmonic basis of the associated algebra is given. It is noted that, for the one sheeted hyperboloid, the vector space…
We introduce a class of linear bounded invertible operators on Banach spaces, called shift operators, which comprises weighted backward shifts and models finite products of weighted backward shifts and dissipative composition operators. We…
Let $S_{\lambdab}$ be a bounded left-invertible weighted shift on a rootless directed tree $\mathcal T=(V, \mathcal E).$ We address the question of when $S_{\lambdab}$ has Wold-type decomposition. We relate this problem to the convergence…
We initiate the study of the forward and backward shifts on the Lipschitz space of a tree, $\mathcal L$, and on the little Lipshitz space of a tree, ${\mathcal L}_0$. We determine that the forward shift is bounded both on $\mathcal L$ and…
We investigate compactness properties of weighted summation operators $V_{\alpha,\sigma}$ as mapping from $\ell_1(T)$ into $\ell_q(T)$ for some $q\in (1,\infty)$. Those operators are defined by $$ (V_{\alpha,\sigma} x)(t)…
We begin by considering the graded vector space with a basis consisting of rooted trees, graded by the count of non-root vertices. We define two linear operators on this vector space, the growth and pruning operators, which respectively…
We prove the spaceability of the set of hypercyclic vectors for {\em shifts-like operators}. Shift-like operators appear naturally as composition operators on $L^p(X)$, when the underlying space $X$ is dissipative. In the process of proving…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
We apply the new orbifold duality transformations to discuss the special case of cyclic coset orbifolds in further detail. We focus in particular on the case of the interacting cyclic coset orbifolds, whose untwisted sectors are…
Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible.…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
Bounded weighted composition operators, as well as compact weighted composition operators, on Fock spaces have been characterised. This characterisation is refined to the extent that the question of whether weighted composition operators on…
Imperative programmers often use cyclically linked trees in order to achieve O(1) navigation time to neighbours. Some logic programmers believe that cyclic terms are necessary to achieve the same in logic-based languages. An old but…