## We given a new version of a theorem of Clay concerning the construction of BIB designs from Frobenius groups. In a recent paper [l] Clay describes a method of constructing BIB designs from Frobenius groups. Let G = N X @ be a Frobenius group with kernel N and complement @. With the same notatio
A note on the construction of certain BIB designs
โ Scribed by R.N. Mohan
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 186 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
In this note a method of construction of certain combinatorial designs is defined. This gives the solution of (121, 132, 60, 55, 27) which is marked as unknown by Kageyama [l].
๐ SIMILAR VOLUMES
In this note initial block technique hzs been used for construction of some cl=s of ## 3-associate PBIB designs, known as rectangular desigus. Let A = MX S be the Cartesian produd of M and S, where .M = (a~, a lr. . . , qn\_3 is an additive group of order m and S = (0, I,. . . , s -1). I& a,l' de
## Abstract In addition to the first part we prove independently of the model some theorems on properties of balanced block designs. Then we propose nine methods of construction of BIB and prove theorems in connection with these methods. In a table we give a survey on block designs with __v__$25 an