An extension of Carlson's inequality is made by using the Euler-Maclaurin summation formula. The integral analogues of this inequality are also presented. ๏ฃฉ 2002 Elsevier Science (USA)
An extension of an inequality of I. Schur
โ Scribed by Geno Nikolov
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 241 KB
- Volume
- 278
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
Denote by ฯ~n~ the set of all algebraic polynomials of degree at most n with complex coefficients. An inequality of I. Schur asserts that the first derivative of the transformed Tchebycheff polynomial $\overline {T}_n (x) = T_n (x , \rm {cos} , {{\pi} \over {2n}})$ has the greatest uniform norm in [โ1, 1] among all f โ ๐ฎ~n~, where
equation image
Here we show that this extremal property of $\overline {T}_n$ persists in the wider class of polynomials f โ ฯ~n~ which vanish at ยฑ1, and for which there exist n โ 1 points ${t_j}^{n-1}_{j=1}$ separating the zeros of $\overline {T}_n$ and such that $|f(t_j)| \le |\overline {T}_n (t_j)|$ for j = 1, โฆ, n โ 1. (ยฉ 2005 WILEYโVCH Verlag GmbH & Co. KGaA, Weinheim)
๐ SIMILAR VOLUMES
## An upper bound for P[W=O], where W is a sum of indicator variables with a special structure, which appears, for example, in subgraph counts in random graphs, is derived. Furthermore, its applications to a problem of k-runs and a random graph problem are given. The result is a generalization and
In this article, using the properties of the power mean, the author proves the inequality ' 1 2 2 valid for any two nonnegative quantities a and a . We shall begin our 1 2 consideration of results which are not as immediately apparent by dis-