|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Generalising Fisher's inequality to coverings and packings | | Daniel Horsley
; | | Date: |
1 Sep 2014 | | Abstract: | In 1940 Fisher famously showed that if there exists a non-trivial
$(v,k,lambda)$-design then $lambda(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,lambda)$-coverings and -packings with $lambda(v-1)<k(k-1)$. | | Source: | arXiv, 1409.0485 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER