Inequalities for t-designs with repeated blocks
โ Scribed by Y. S. Ho; N. S. Mendelsohn
- Publisher
- Springer
- Year
- 1974
- Tongue
- English
- Weight
- 345 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
To Haim Hanani on his seventy-fifth birthday
We study several classes of arrays generalizing designs and orthogonal arrays. We use these to construct non-trivial t-designs without repeated blocks for all t. ## 1. Designs and arrays In this paper, we will assume all sets that are not obviously infinite, to be finite. If X and Y are sets, X Y
We present here some new constructions of block designs with repeated blocks for arbitrary k. We include some interesting examples. A partial answer to a question raised by Hedayat is also given.