A new proof is given of the nonuniform version of Fisher's inequality, first proved by Majumdar. The proof is ``elementary,'' in the sense of being purely combinatorial and not using ideas from linear algebra. However, no nonalgebraic proof of the n-dimensional analogue of this result (Theorem 3 her
On the Nonuniform Fisher Inequality
✍ Scribed by László Babai
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 298 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Let 3~ be a family of m subsets (lines) of a set of n elements (points). Suppose that each pair of lines has ~ points in common for some positive ~.. The Nonuniform Fisher Inequality asserts that under these circumstances m <~ n. We examine the case when m = n. We give a short proof of the fact that (with the exception of a trivial case) such an ~ must behave like a geometry in the following sense: a line must pass through each pair of points. This generalizes a result of de Bruijn and Erd6s.
📜 SIMILAR VOLUMES
defined the notion of t -designs in Q -polynomial association schemes and gave a Fisher type bound using linear programming . For each classical association scheme there is a
In this article, using the properties of power mean and induction, new strengthened Carleman's inequality and Hardy's inequality are obtained. We also give an answer to the conjectures proposed by X. Yang in the literature Yang (2001) .
In this note, we establish a sequence of maximal inequalities for sums of i.i.d, random variables which sharpen Hoeffding's inequality and many other similar results.