English

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

Functional Analysis 2019-05-27 v1

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 11 and its subtree which is the "truncation" of the full tree to vertices of generation not exceeding 22. 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 22-atomic. As a consequence, we obtain a solution of the subnormal completion problem for this pair of directed trees when η<\eta < \infty. If η=2\eta=2, we present a solution written explicitly in terms of initial data.

Keywords

Cite

@article{arxiv.1905.10122,
  title  = {A Subnormal Completion Problem for Weighted Shifts on Directed Trees, II},
  author = {George R. Exner and Il Bong Jung and Jan Stochel and Hye Yeong Yun},
  journal= {arXiv preprint arXiv:1905.10122},
  year   = {2019}
}

Comments

19 pages, 4 figures

R2 v1 2026-06-23T09:21:54.446Z