✦ LIBER ✦

Fisher's inequality revisited

✍ Scribed by Takashi Hara; Hal Tasaki

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 165 KB
Volume: 100
Category: Article
ISSN: 0375-9601
DOI: 10.1016/0375-9601(84)90958-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Generalization of Fisher's Inequality

✍ Hunter S. Snevily 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 97 KB

In this paper we are concerned with the following conjecture. Conjecture: Let L be a collection of k positive integers and In particular, we show this conjecture is true when L consists of k consecutive positive integers. This generalizes a well-known inequality of Fisher's. Our proof simplifies an

A Note on Fisher's Inequality

✍ Douglas R. Woodall 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

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

A sharpening of Fisher's inequality

✍ Peter Frankl; Zoltán Füredi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 261 KB

on v points and b lines the number of intersecting line-pairs is at least (z). This clearly implies b 2 v.

Fisher's inequality for tactical configu

Fisher's inequality for tactical configurations

✍ A. Ya. Petrenyuk 📂 Article 📅 1968 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 259 KB

A short proof of fisher's inequality

✍ Renaud Palisse 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 71 KB

Nous donnons ici une dtmonstration nouvelle, trts courte, de I'iGgaliti de Fisher, qui gCntralise un rCsultat bien connu de de Bruijn et ErdGs. Cette dtmonstration utilise essentiellement une id&e de Tverberg (1982) pour dt-montrer un autre tnonct combinatoire. We prove the following result.

A Fisher type inequality

✍ D.E. Keenan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 318 KB

tn this paper we study subsets of 8 finite set that intersect each other in at most one eleml~ont, Etch subaet intersects mogt of the other subsets in exwtly one element. The Mowing theorem is one of our main conduaions, tot S,, 1 . . , S,,, be m subrreta ot' an n=aet S with IS,1 22 (1~ I, 1.1, tti)