2019
DOI: 10.1090/tran/7959
|View full text |Cite
|
Sign up to set email alerts
|

Self-adjoint Jacobi matrices on trees and multiple orthogonal polynomials

Abstract: We consider a set of measures on the real line and the corresponding system of multiple orthogonal polynomials (MOPs) of the first and second type. Under some very mild assumptions, which are satisfied by Angelesco systems, we define self-adjoint Jacobi matrices on certain rooted trees. We express their Green's functions and the matrix elements in terms of MOPs. This provides a generalization of the well-known connection between the theory of polynomials orthogonal on the real line and Jacobi matrices on Z + t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 51 publications
0
14
0
Order By: Relevance
“…The following theorem provides the connection between operators L plq c and J κ, N . It is stated in [9] for c P p0, 1q and is a simple consequence of the results of [42]. Its extension to c P t0, 1u was obtained in [10].…”
Section: Definitionsmentioning
confidence: 92%
See 2 more Smart Citations
“…The following theorem provides the connection between operators L plq c and J κ, N . It is stated in [9] for c P p0, 1q and is a simple consequence of the results of [42]. Its extension to c P t0, 1u was obtained in [10].…”
Section: Definitionsmentioning
confidence: 92%
“…In this part of the paper, we consider Angelesco system, as in Part 3, see (3.0.1), in the case when supp µ i " ∆ i , dµ i pxq " µ 1 i pxqdx, µ i pxq ą 0, x P ∆ i , and µ 1 i pxq is a restriction of an analytic function defined around ∆ i . This situation was studied in great detail in [9] and [10], see also [42]. In particular, it was proved that J κ, N converges to a limiting operator L piq c when N goes to infinity along the ray N c " n : n i " c i | n| `op| n|q, i P t1, 2u ( , pc 1 , c 2 q " pc, 1 ´cq, c P r0, 1s.…”
Section: Appendix To Partmentioning
confidence: 99%
See 1 more Smart Citation
“…Remark 6.3 (Jacobi matrices on graphs). Sometimes the second order difference expression (6.3) is called a Jacobi matrix on a graph (cf., e.g., [3], [4]). Indeed, if V = Z ≥0 and b is a path graph over Z ≥0 , that is, b(n, m) > 0 exactly when |n − m| = 1, then (6.3) can be written as a Jacobi (tri-diagonal) matrix…”
Section: The Glazman-povzner-wienholtz Theorem On Weighted Graphsmentioning
confidence: 99%
“…First of all, in view of [1,Remark A.11] the hypotheses of Proposition 3.2 are satisfied. Hence, the corresponding matrix satisfies (NDB).…”
mentioning
confidence: 99%