Related papers: On complex symmetric weighted shifts. II
We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
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.…
In this paper, we study the hypercyclicity of forward and backward shifts on weighted $L^p$ spaces of a directed tree. In the forward case, only the trivial trees may support hypercyclic shifts, in which case the classical results of Salas…
It is shown that for any positive integer n there exists a subnormal weighted shift on a directed tree whose nth power is closed and densely defined while its (n + 1)th power has trivial domain. Similar result for composition operators in…
Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
We completely characterize non-periodic balanced weighted shifts $S_{\lambdab}$ on rooted directed trees under a very mild assumption that $S_{\lambdab}^{*n}S_{\lambdab}^n|_{\ker S_{\lambdab}^*}$ is invertible operator on $\ker…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
We prove that it is decidable whether a one-sided shift of finite type is conjugate to a one-sided Hom-shift, and whether a tree-shift of finite type is conjugate to a Hom tree-shift. The proof uses Williams's theory for one-sided shifts
Some symmetry problems are formulated and solved. New simple proofs are given for the earlier studied symmetry problems.
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
We continue study of some algebraic varieties (called resultantal varieties) started in a paper of A. Grishkov, D. Logachev "Resultantal varieties related to zeroes of L-functions of Carlitz modules". These varieties are related with the…
We establish some asymptotic expansions for infinite weighted convolution of distributions having regular varying tails. Various applications to statistics and probability are developed.
We study the complex symmetric structure of weighted composition--differentiation operators of order $n $ on the weighted Bergman spaces $A_{\alpha}^2$ with respect to some conjugations. Then we provide some examples of these operators.
We investigate finite and infinite nested square root formulas convergent to unity.
It is proved that, up to isomorphism, there are only two directed trees that admit a hyponormal weighted shift with nonzero weights whose square has trivial domain. These are precisely those enumerable directed trees, one with root, the…
This paper explores the notions of $\mathcal{F}$-transitivity and topological $\mathcal{F}$-recurrence for backward shift operators on weighted $\ell^p$-spaces and $c_0$-spaces on directed trees, where $\mathcal{F}$ represents a Furstenberg…
A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the…