R ---\* R is even, and "smooth," and of faster than polynomial growth at infinity. For example, we consider Q(x) = exp k/(]xla), a > 1, where expk = exp(exp(.., exp(... ))) denotes the k th iterated exponential. Weights of the form W 2 for such W are often called ErdSs weights. We compute the growth
✦ LIBER ✦
The supremum norm of reciprocals of Christoffel functions for Erdős weights
✍ Scribed by D.S Lubinsky; T.Z Mthembu
- Book ID
- 107777078
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 417 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The weighted Lp-norms of orthonormal pol
✍
D.S. Lubinsky
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 552 KB
Asymptotic behaviour of the ratio of Chr
✍
Arnold Knopfmacher; D.S Lubinsky
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 893 KB
Erdős-Turʼan-Type Discrepancy for the Ze
✍
Fieger, Regina; Blatt, Hans-Peter
📂
Article
📅
2013
🏛
Elsevier Science
🌐
English
⚖ 204 KB
Mean and uniform convergence of Lagrange
✍
Hee Sun Jung, Ryozi Sakai
📂
Article
📅
2012
🏛
Hindawi Publishing Corporation
🌐
English
⚖ 320 KB
The Erdős-Sós conjecture for graphs of g
✍
Stephan Brandt; Edward Dobson
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 167 KB
The Erdős-Sós Conjecture for trees of di
✍
Andrew McLennan
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 100 KB
## Abstract The Erdős‐Sós Conjecture is that a finite graph __G__ with average degree greater than __k__ − 2 contains every tree with __k__ vertices. Theorem 1 is a special case: every __k__‐vertex tree of diameter four can be embedded in __G__. A more technical result, Theorem 2, is obtained by ex