Abstract
The inequality Tn(xy) ≤ Tn(x) Tn(y), x, y ≥ 1, where Tn(x) is the Tchebycheff polynomial of the first kind, can be proven very easily by use of one of the extremal properties of these polynomials. It also follows from ( d2 du2) log Tn(eu) ≤ 0, u ≥ 0. Various proofs are given for these inequalities and for generalizations to other classes of polynomials.
| Original language | English |
|---|---|
| Pages (from-to) | 1-11 |
| Number of pages | 11 |
| Journal | Journal of Approximation Theory |
| Volume | 14 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 1975 |
Bibliographical note
Funding Information:* Research supported in part by NSF Grant GP-33897. + Research supported in part by NSF Grant GP-32116 and in part by the Alfred Foundation. * Research supported in part by NSF Grant GP-33117.
Funding
* Research supported in part by NSF Grant GP-33897. + Research supported in part by NSF Grant GP-32116 and in part by the Alfred Foundation. * Research supported in part by NSF Grant GP-33117.
| Funders | Funder number |
|---|---|
| Alfred P Sloan Foundation | GP-33117 |
| National Science Foundation Arctic Social Science Program | GP-33897, GP-32116 |
ASJC Scopus subject areas
- Analysis
- Numerical Analysis
- General Mathematics
- Applied Mathematics