2020
DOI: 10.1016/j.aim.2020.107241
|View full text |Cite
|
Sign up to set email alerts
|

Periodic Jacobi matrices on trees

Abstract: We begin the systematic study of the spectral theory of periodic Jacobi matrices on trees including a formal definition. The most significant result that appears here for the first time is that these operators have no singular continuous spectrum. We review important previous results of Sunada and Aomoto and present several illuminating examples. We present many open problems and conjectures that we hope will stimulate further work.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
65
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(66 citation statements)
references
References 60 publications
(72 reference statements)
1
65
0
Order By: Relevance
“…Example 3.1. The free Laplacian on a degree d homogeneous tree has a Green's function (diagonal matrix element of the resolvent) that is well-known and computed, for example, in [3,Example 7.1]. [3, (7.3)] says that…”
Section: Antibound Conjecturementioning
confidence: 99%
See 4 more Smart Citations
“…Example 3.1. The free Laplacian on a degree d homogeneous tree has a Green's function (diagonal matrix element of the resolvent) that is well-known and computed, for example, in [3,Example 7.1]. [3, (7.3)] says that…”
Section: Antibound Conjecturementioning
confidence: 99%
“…The rg-model [3, Example 7.2] mentioned at the end of Section 2 was originally emphasized by Aomoto [1] because he showed, by proving one of its Green's functions had a pole, it has a point eigenvalue at 0 which is outside the continuous spectrum of H. Earlier, Godsil-Mohar [10] had also noted the model had a spectral measure with a pure point at zero and computed the weight it contributes to the IDS. [3] wrote down an explicit zero energy eigenvector, namely view the corresponding tree T r,g (with r > g) as a tree centered at a single red vertex at level 0, with g vertices at level 1, then g(r − 1) vertices at level 2, each level 1 vertex linked to r − 1 level 2 vertices, etc. Thus, level 2k − 1; k = 1, 2, .…”
Section: The Rg-modelmentioning
confidence: 99%
See 3 more Smart Citations