Abstract

A rooted directed tree T=(V,E)\mathscr T=(V, E) with can be extended to a directed graph T∞=(V∞,E∞)\mathscr T_\infty=(V_\infty, E_\infty) by adding a vertex ∞\infty to VV and declaring each vertex in VV as a parent of ∞.\infty. One may associate with the extended directed tree a family of semigroup structures ⊔b\sqcup_{b} with extreme ends being induced by the join operation ⊔\sqcup and the meet operation ⊓\sqcap. Each semigroup structure among these leads to a family of densely defined linear operators WλubW^{b}_{λ_u} acting on ℓ2(V),\ell^2(V), which we refer to as weighted join operators at a given base point b∈V∞b \in V_{\infty} with prescribed vertex u∈Vu \in V. The extreme ends of this family are weighted join operators WλurootW^{\mathsf{root}}_{λ_u} and weighted meet operators Wλu∞W^{\infty}_{λ_u}. In this paper, we systematically study these operators. We also present a more involved counter-part of weighted join operators on rootless directed trees. In both cases, the class of weighted join operators overlaps with the well-studied classes of complex Jordan operators and nn-symmetric operators. An important half of this paper is devoted to the study of rank one extensions Wf,gW_{f, g} of weighted join operators, where f∈ℓ2(V)f \in \ell^2(V) and g:V→Cg : V \to \mathbb C is unspecified. Unlike weighted join operators, these operators are not necessarily closed. We provide a couple of compatibility conditions involving the weight system λuλ_u and gg to ensure closedness of Wf,gW_{f, g}. We discuss the role of the Gelfand-triplet in the realization of the Hilbert space adjoint of Wf,gW_{f, g}. Further, we describe various spectral parts of Wf,gW_{f, g} in terms of the weight system and the tree data. We also provide sufficient conditions for Wf,gW_{f, g} to be a sectorial operator. In case T\mathscr T is leafless, we characterize rank one extensions Wf,gW_{f, g}, which admit compact resolvent.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.