2016
DOI: 10.1007/s00365-016-9351-5
|View full text |Cite
|
Sign up to set email alerts
|

Bounds on Order of Indeterminate Moment Sequences

Abstract: We investigate the order ρ of the four entire functions in the Nevanlinna matrix of an indeterminate Hamburger moment sequence. We give an upper estimate for ρ which is explicit in terms of the parameters of the canonical system associated with the moment sequence via its three-term recurrence. Under a weak regularity assumption this estimate coincides with a lower estimate, and hence ρ becomes computable. Dropping the regularity assumption leads to examples where upper and lower bounds do not coincide and dif… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
1

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 13 publications
0
9
1
Order By: Relevance
“…The estimate from theorem 4.1 is incomparable with the one obtained recently in [31]; in some cases it is better, and in some others it is worse, cf. proposition 4.5 and example 4.6.…”
Section: Introductioncontrasting
confidence: 68%
See 2 more Smart Citations
“…The estimate from theorem 4.1 is incomparable with the one obtained recently in [31]; in some cases it is better, and in some others it is worse, cf. proposition 4.5 and example 4.6.…”
Section: Introductioncontrasting
confidence: 68%
“…Example 4.8. We revisit the Hamiltonians constructed in proposition 4.5 (so to make sure that order cannot be computed already from [31]), and consider the associated Jacobi matrices. Let h be a decreasing sequence with (4.3) which has the property that ((h n )/(h n+1 )) 1.…”
Section: Discussion Of Berezanskii's Theoremmentioning
confidence: 99%
See 1 more Smart Citation
“…Now we write the Jacobi matrix as a Hamburger Hamiltonian of a canonical system, cf. [18] or [13] for details about this reformulation. We denote by (l n ) ∞ n=1 and (φ n ) ∞ n=1 the sequences of lengths and angles of the corresponding Hamburger Hamiltonian.…”
Section: Step 3: the Upper Bound In The Lccmentioning
confidence: 99%
“…With the notation from [18], the lengths and angle-differences are regularly distributed. Moreover, we have ∆ l = −2γ and ∆ φ = β + 2γ, both expressions exist as a limit and ∆ l + ∆ φ = β.…”
Section: Step 3: the Upper Bound In The Lccmentioning
confidence: 99%