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 Janson's inequality
✍ Scribed by Małgorzata Roos
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 521 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
✦ Synopsis
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 an improvement of the well-known Janson's inequality.
📜 SIMILAR VOLUMES
## 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
We offer a new proof of the well-known Steffensen Inequality, whose context is sufficiently general that it engenders a number of extensions.
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-