𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A recursive method of construction of resolvable BIB-designs

✍ Scribed by B. T. Rumov


Publisher
SP MAIK Nauka/Interperiodica
Year
1977
Tongue
English
Weight
340 KB
Volume
21
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A recursive method for construction of d
✍ D.K. Ray-Chaudhuri; Tianbao Zhu πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 497 KB

Ray-Chaudhuri, D.K., T. Zhu, A recursive method for construction of designs, Discrete Mathematics 106/107 (1992) 399-406. In this paper, we generalize Blanchard and Narayani's constructions of designs in the following ways. (1) By applying an orthogonal array to the construction, we can reduce the

A construction of resolvable nested 3-de
✍ Shivani Rai; Shakti Banerjee; Sanpei Kageyama πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 83 KB

## Abstract A method of constructing resolvable nested 3‐designs from an affine resolvable 3‐design is proposed with one example. Β© 2004 Wiley Periodicals, Inc.

New Constructions of BIB Designs
✍ Dr. S. Kageyama; Dr. R. N. Mohan πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 186 KB πŸ‘ 1 views

A method of construction of certain balanced incomplete block (BIB) designs is defined from which we get new series of BIB designs. ## 1 . Introduction For a BIB design with parameters v, b, r , k, I if the blocks can be separated into t

A note on the construction of certain BI
✍ R.N. Mohan πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 186 KB

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].

Construction of Resolvable Designs with
✍ E.R. Williams; J.A. John πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views

The construction of resolvable incomplete block and row-column designs is investigated when the treatments have a nested structure. Some theoretical results are derived for lattice designs. Efficient designs for unequal-sized treatment groups are obtained by defining a multiple objective function an

On a construction of clay of bib designs
✍ Mauro Biliotti πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 160 KB

## 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