𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions for rotational near resolvable block designs

✍ Scribed by R. Julian R. Abel; Marco Buratti; Malcolm Greig; Ying Miao

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
201 KB
Volume
9
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A (Ξ½, k, kβˆ’1) near resolvable block design (NRBD) is r‐rotational over a group G if it admits G as an automorphism group of order (Ξ½βˆ’1)/r fixing exactly one point and acting semiregularly on the others. We give direct and recursive constructions for rotational NRBDs with particular attention to 1‐rotational ones. Β© 2001 John Wiley & Sons, Inc. J Combin Designs 9: 157–181, 2001

πŸ“œ SIMILAR VOLUMES

Constructions for near resolvable design
Constructions for near resolvable designs and BIBDs
✍ Tran van Trung πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

The purpose of this article is twofold. First, it is shown that classical inversive planes of even order can be used to construct a class of 2 -(2 2n +1, 2 n , 2 n -1) near resolvable designs, in which any two blocks have at most 2 points in common. Secondly, it is shown that a recursive constructio

Existence results for near resolvable de
Existence results for near resolvable designs
✍ Steven Furino πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 572 KB

A near resolvable design, NRB(v, k), is a balanced incomplete block design whose block set can be partitioned into v classes such that each class contains every point of the design but one, and each point is missing from exactly one class. The necessary conditions for the existence of near resolvabl

Two new direct product-type construction
Two new direct product-type constructions for resolvable group-divisible designs
✍ Rolf S. Rees πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 658 KB

## Abstract We present two direct product‐type constructions which will prove useful in the construction of resolvable designs. We use our constructions to complete the spectrum for resolvable group‐divisible designs with block size three, as well as to give a short proof of the existence of decomp