2016
DOI: 10.1112/jlms/jdw029
|View full text |Cite
|
Sign up to set email alerts
|

An analytic model for left-invertible weighted shifts on directed trees: Table 1.

Abstract: Let T be a rooted directed tree with finite branching index k T , and let S λ ∈ B(l 2 (V )) be a leftinvertible weighted shift on T . We show that S λ can be modelled as a multiplication operator Mz on a reproducing kernel Hilbert space H of E-valued holomorphic functions on a disc centred at the origin, where E := ker S * λ . The reproducing kernel associated with H is multi-diagonal and of bandwidth k T . Moreover, H admits an orthonormal basis consisting of polynomials in z with at most k T + 1 non-zero coe… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
48
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 22 publications
(48 citation statements)
references
References 33 publications
0
48
0
Order By: Relevance
“…The main result of this section characterizes a class of left-invertible analytic weighted shifts on a locally finite one-circuit directed graph (see Theorem 2.1 and Remark 2.2). Unlike weighted shifts on rooted directed trees (see [12,Lemma 3.3]), these shifts need not be analytic. Indeed, they may admit non-zero eigenvalues (cf.…”
Section: Analyticity Of Weighted Shifts On One-circuit Directed Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…The main result of this section characterizes a class of left-invertible analytic weighted shifts on a locally finite one-circuit directed graph (see Theorem 2.1 and Remark 2.2). Unlike weighted shifts on rooted directed trees (see [12,Lemma 3.3]), these shifts need not be analytic. Indeed, they may admit non-zero eigenvalues (cf.…”
Section: Analyticity Of Weighted Shifts On One-circuit Directed Graphsmentioning
confidence: 99%
“…Needless to say, these examples shed light on the role of the expansivity property in Question 1.2. Our construction capitalizes on the idea of weighted shift operator on directed graph recently boosted in the realm of graph-theoretic operator theory (refer to [18], [12], [8], [13]).…”
Section: Introductionmentioning
confidence: 99%
“…For a left invertible semigroup {S t }, the application of Lemma 3.5 to a semigroup {S ′ t } yields the subspaces {S ′ t n E} ∞ n=0 are also mutually orthogonal.The following theorem describes the analytic model for the left invertible weighted translation semigroup {S t }. The reader may compare this theorem with[5, Theorem 2.7] for a similar model developed in the context of weighted shifts on directed trees.…”
mentioning
confidence: 93%
“…Following [20], the reproducing kernel for H is an B(E)-valued function of two variables κ H : Ω × Ω → B(E) that The class of weighted shifts on a directed tree was introduced in [9] and intensively studied since then [7,2,4]. The class is a source of interesting examples (see e.g., [8,13]).…”
Section: Introductionmentioning
confidence: 99%