Generalising Fisher's inequality to coverings and packings

preprint2016arXivOpen access

Abstract

In 1940 Fisher famously showed that if there exists a non-trivial (v,k,λ)(v,k,λ)-design then λ(v−1)≥k(k−1)λ(v-1) \geq k(k-1). Subsequently Bose gave an elegant alternative proof of Fisher's result. Here, we show that the idea behind Bose's proof can be generalised to obtain new bounds on the number of blocks in (v,k,λ)(v,k,λ)-coverings and -packings with λ(v−1)<k(k−1)λ(v-1)<k(k-1).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.