An extension of the information inequality and related characterizations
β Scribed by V. Papathanasiou
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 348 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
π 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-
## 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 great