pith. sign in

arxiv: 1905.10122 · v1 · pith:GTGYGCPXnew · submitted 2019-05-24 · 🧮 math.FA

A Subnormal Completion Problem for Weighted Shifts on Directed Trees, II

classification 🧮 math.FA
keywords directedsubnormalcompletionproblemtreeweightssolutionsubtree
0
0 comments X
read the original abstract

The subnormal completion problem on a directed tree is to determine, given a collection of weights on a subtree, whether the weights may be completed to the weights of a subnormal weighted shift on the directed tree. We study this problem on a directed tree with a single branching point, $\eta$ branches and the trunk of length $1$ and its subtree which is the "truncation" of the full tree to vertices of generation not exceeding $2$. We provide necessary and sufficient conditions written in terms of two parameter sequences for the existence of a subnormal completion in which the resulting measures are $2$-atomic. As a consequence, we obtain a solution of the subnormal completion problem for this pair of directed trees when $\eta < \infty$. If $\eta=2$, we present a solution written explicitly in terms of initial data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.