✦ LIBER ✦

Constructions for near resolvable designs and BIBDs

✍ Scribed by Tran van Trung

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 355 KB
Volume: 7
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1999)7:3<227::aid-jcd6>3.0.co;2-s

No coin nor oath required. For personal study only.

✦ Synopsis

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 construction method for BIBDs using resolvable BIBDs due to Shrikhande and Raghavarao can be extended by using near resolvable designs.

📜 SIMILAR VOLUMES

Constructions for rotational near resolv

Constructions for rotational near resolvable block designs

✍ R. Julian R. Abel; Marco Buratti; Malcolm Greig; Ying Miao 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

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

Balanced tournament designs and resolvab

Balanced tournament designs and resolvable (υ, 3, 2)-bibds

✍ E.R. Lamken; S.A. Vanstone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 721 KB

In this paper, we present new constructions for resolvable and near resolvable (v, 3, 2)-BIBDs. These constructions use balanced tournament designs and odd balanced tournament designs. We then use balanced tournament designs with almost orthogonal resolutions and odd balanced tournament designs with

Block designs with large holes and α -re

Block designs with large holes and α -resolvable BIBDs

✍ Steven C. Furino; Ronald C. Mullin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

## Abstract In a (__v, k__, λ: __w__) incomplete block design (IBD) (or PBD [__v, {k, w__^\*^}. λ]), the relation __v__ ≥ (__k__ − 1)__w__ + 1 must hold. In the case of equality, the IBD is referred to as a block design with a large hole, and the existence of such a configuration is equivalent to t

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

Existence results for doubly near resolv

Existence results for doubly near resolvable (υ, 3, 2)-BIBDs

✍ E.R. Lamken; S.A. Vanstone 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Let V be a set of u elements. A (1,2; 3,v, I)-frame F is a square array of side v which satisfies the following properties. We index the rows and columns of F with the elements of V, V= {x Ir x2,, ,x,}. (1) Each cell is either empty or contains a 3-subset of V. (2) Cell (xi. xi) is empty for i= 1,2

The existence of doubly near resolvable

The existence of doubly near resolvable (v,3,2)-BIBDs

✍ E. R. Lamken 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

The existence of doubly near resolvable (v, 2,1)-BZBDs was established by Mullin and Wallis in 1975. In this article, we determine the spectrum of a second class of doubly near resolvable balanced incomplete block designs. We prove the existence of DNR(v,3,2)-BZBDs for v = 1 (mod 3), v 2 10 and v @