2019
DOI: 10.4171/jst/273
|View full text |Cite
|
Sign up to set email alerts
|

Spectral edge behavior for eventually monotone Jacobi and Verblunsky coefficients

Abstract: We consider Jacobi matrices with eventually increasing sequences of diagonal and off-diagonal Jacobi parameters. We describe the asymptotic behavior of the subordinate solution at the top of the essential spectrum, and the asymptotic behavior of the spectral density at the top of the essential spectrum.In particular, allowing on both diagonal and off-diagonal Jacobi parameters perturbations of the free case of the form − J j=1 cjn −τ j + o(n −τ 1 −1 ) with 0 < τ1 < τ2 < · · · < τJ and c1 > 0, we find the asymp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 12 publications
0
1
0
Order By: Relevance
“…Translated into the language of random operators, the asymptotics of N (x) near E 0 corresponds to what is called Lifshitz tails [24]. For a random Schrödinger operator on Z d , Lifshitz predicted N (x) ∼ c 1 e −c 2 (x−E 0 ) −d/2 , which was later confirmed in some cases (for a related result, see [28]). From [21] it follows that for random operators corresponding to an operator of convolution given by 1 4 (a + a −1 + b + b −1 ), the function 1 − N (x) behaves as e −(x−1) −1 near E + .…”
Section: Concluding Remarks and Open Problemsmentioning
confidence: 87%
“…Translated into the language of random operators, the asymptotics of N (x) near E 0 corresponds to what is called Lifshitz tails [24]. For a random Schrödinger operator on Z d , Lifshitz predicted N (x) ∼ c 1 e −c 2 (x−E 0 ) −d/2 , which was later confirmed in some cases (for a related result, see [28]). From [21] it follows that for random operators corresponding to an operator of convolution given by 1 4 (a + a −1 + b + b −1 ), the function 1 − N (x) behaves as e −(x−1) −1 near E + .…”
Section: Concluding Remarks and Open Problemsmentioning
confidence: 87%
“…In fact, this set is not sufficiently well-understood, see e.g. [36]; 2] : The measure µ restricted to this set is always discrete.…”
Section: Annales De L'institut Fouriermentioning
confidence: 99%