A Subnormal Completion Problem for Weighted Shifts on Directed Trees, II
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, η 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 η < ∞. If η=2, we present a solution written explicitly in terms of initial data.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.