1995
DOI: 10.1006/jath.1995.1077
|View full text |Cite
|
Sign up to set email alerts
|

On Exceptional Sets of Asymptotic Relations for General Orthogonal Polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
29
0

Year Published

1996
1996
2020
2020

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 22 publications
(30 citation statements)
references
References 0 publications
1
29
0
Order By: Relevance
“…As a counterpart of Proposition 3.2(a) and (33), we may prove uniform convergence of quite a dense subsequence in some neighborhood of any`# 0 with geometric rate. This generalizes a result of Ambroladze [1,Corollaries 3 and 4], who studied the special case of real recurrence coefficients. |4 } a n } r n (z) } r n+1 (z)| 1Â(2n) , n 0, z # U.…”
Section: Local Uniform Convergence Of Bounded J-fractionssupporting
confidence: 70%
See 2 more Smart Citations
“…As a counterpart of Proposition 3.2(a) and (33), we may prove uniform convergence of quite a dense subsequence in some neighborhood of any`# 0 with geometric rate. This generalizes a result of Ambroladze [1,Corollaries 3 and 4], who studied the special case of real recurrence coefficients. |4 } a n } r n (z) } r n+1 (z)| 1Â(2n) , n 0, z # U.…”
Section: Local Uniform Convergence Of Bounded J-fractionssupporting
confidence: 70%
“…Let 4/N be infinite, = n # [0, 1], and suppose that the sequence of measure (+ n+= n ) n # 4 and (+ n+1&= n ) n # 4 converge weakly to + (0) , and to + (1) , respectively. Then the potentials of both limit measures coincide in 0 0 .…”
Section: N Th-root Asymptotic Behaviormentioning
confidence: 99%
See 1 more Smart Citation
“…There is a version of (15) (see [1], Theorem 1$) giving uniform convergence in a neighbourhood of an arbitrary point of 0. That gives a corresponding version of (7) with uniform convergence.…”
Section: Proofsmentioning
confidence: 98%
“…(1) The assumption S = Clos(Int(S))) for S = supp(µ) is strongly used, which does not allow outliers. (2) The assumption S = Clos(Int(S))) is strongly used also to give upper bounds for K µ ntot(m) (z, z) in supp(µ) at some distance from the boundary. This condition could be replaced by stepping to the relative interior of supp(µ) in S(µ) ∩ R d (in the real setting) or S(µ) in the complex setting.…”
Section: Approximation Of Christoffel-darboux Kernelsmentioning
confidence: 99%