𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A construction of resolvable nested 3-designs

✍ Scribed by Shivani Rai; Shakti Banerjee; Sanpei Kageyama

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
83 KB
Volume
12
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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

πŸ“œ SIMILAR VOLUMES

Construction of Resolvable Designs with
Construction of Resolvable Designs with Nested Treatment Structure
✍ 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

Embeddability and construction of affine
Embeddability and construction of affine Ξ±-resolvable pairwise balanced designs
✍ Boris Bekker; Yury J. Ionin; Mohan S. Shrikhande πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 315 KB πŸ‘ 1 views

An affine Ξ±-resolvable PBD of index Ξ» is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in Ξ» blocks, (ii) any point occurs in Ξ± blocks of each

Construction of Partially Balanced Incom
Construction of Partially Balanced Incomplete Block Designs with Nested Rows and Columns
✍ H. L. Agrawal; J. Frasad πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 363 KB πŸ‘ 2 views

A number of methods of construction of partially balanced inconiplete block designs with nested rows and columns are developed and new balanced incomp1et.e block designs with nested rows and columns are obtained as a by-product.

Enumeration of resolvable 2-(10, 5, 16)
Enumeration of resolvable 2-(10, 5, 16) and 3-(10, 5, 6) designs
✍ Luis B. Morales; Carlos Velarde πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 207 KB

## Abstract A backtracking over parallel classes with a partial isomorph rejection (PIR) is carried out to enumerate the resolvable 2‐(10,5,16) designs. Computational results show that the inclusion of PIR reduce substantially the CPU time for the enumeration of all designs. We prove first some res