Abstract

A new class of (not necessarily bounded) operators related to (mainly innite) directed trees is introduced and investigated. Operators in question are to be considered as a generalization of classical weighted shifts, on the one hand, and of weighted adjacency operators, on the other; they are called weighted shifts on directed trees. The basic properties of such op- erators, including closedness, adjoints, polar decomposition and moduli are studied. Circularity and the Fredholmness of weighted shifts on directed trees are discussed. The relationships between domains of a weighted shift on a directed tree and its adjoint are described. Hyponormality, cohyponormality, subnormality and complete hyperexpansivity of such operators are entirely characterized in terms of their weights. Related questions that arose during the study of the topic are solved as well. Particular trees with one branching vertex are intensively studied mostly in the context of subnormality and com- plete hyperexpansivity of weighted shifts on them. A strict connection of the latter with k-step backward extendibility of subnormal as well as completely hyperexpansive unilateral classical weighted shifts is established. Models of subnormal and completely hyperexpansive weighted shifts on these particular trees are constructed. Various illustrative examples of weighted shifts on di- rected trees with the prescribed properties are furnished. Many of them are simpler than those previously found on occasion of investigating analogical properties of other classes of operators.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.