A Subnormal Completion Problem for Weighted Shifts on Directed Trees

Author(s):  
George R. Exner ◽  
Il Bong Jung ◽  
Jan Stochel ◽  
Hye Yeong Yun
1994 ◽  
Vol 18 (4) ◽  
pp. 369-426 ◽  
Author(s):  
Ra�l E. Curto ◽  
Lawrence A. Fialkow

1993 ◽  
Vol 17 (2) ◽  
pp. 202-246 ◽  
Author(s):  
Ra�l E. Curto ◽  
Lawrence A. Fialkow

2021 ◽  
Vol 93 (5) ◽  
Author(s):  
Zenon Jan Jabłoński ◽  
Jakub Kośmider

AbstractThe aim of this paper is to investigate m–isometric composition operators on directed graphs with one circuit. We establish a characterization of m–isometries and prove that complete hyperexpansivity coincides with 2–isometricity within this class. We discuss the m–isometric completion problem for unilateral weighted shifts and for composition operators on directed graphs with one circuit. The paper is concluded with an affirmative solution of the Cauchy dual subnormality problem in the subclass with circuit containing one element.


2020 ◽  
Vol 92 (1) ◽  
Author(s):  
George R. Exner ◽  
Il Bong Jung ◽  
Jan Stochel ◽  
Hye Yeong Yun

2021 ◽  
Vol 501 (2) ◽  
pp. 125206
Author(s):  
Xu Tang ◽  
Caixing Gu ◽  
Yufeng Lu ◽  
Yanyue Shi

2021 ◽  
Vol 9 (1) ◽  
pp. 226-239
Author(s):  
D. Carter ◽  
K.E. DiMarco ◽  
C.R. Johnson ◽  
L. Wedemeyer ◽  
Z. Yu

Abstract The 3-by-n TP-completable patterns are characterized by identifying the minimal obstructions up to natural symmetries. They are finite in number.


2021 ◽  
Vol 93 (3) ◽  
Author(s):  
You Qing Ji ◽  
Li Liu
Keyword(s):  

2017 ◽  
Vol 66 (5) ◽  
pp. 861-868 ◽  
Author(s):  
Nir Cohen ◽  
Edgar Pereira
Keyword(s):  

2012 ◽  
Vol 312 (22) ◽  
pp. 3306-3315 ◽  
Author(s):  
Ramón Béjar ◽  
Cèsar Fernández ◽  
Carles Mateu ◽  
Magda Valls

Sign in / Sign up

Export Citation Format

Share Document