REDUCED RESIDUE CLASSES CYCLIC PBIB DESIGNS

A new general class of m-class cyclic association scheme is defined for v treatments, where v is a composite number. A simple method of construction of PBIB designs having this association scheme using more than one initial block and some methods using only one initial block are proposed. A complete analysis of this type of PBIB designs is given. Also given is a list of 39 useful PBIB designs of this type having v≤15 and r≤10 and having only three associate classes together with their efficiency factors for all types of comparisons and over all efficiency factors.     

Connectedness of PBIB designs

A necessary and sufficient condition for the connectedness of an m-associate-class PBIB design is derived in a form, and using an approach, different from those in Ogawa, Ikeda, and Kageyama (1984) and Saha and Kageyama (1984). The applicability of this condition is shown in the context of group-divisible m-associate-class PBIB designs.     

An infinite class of PBIB designs

In this paper, an infinite class of partially balanced incomplete block (PBIB) designs of m+1 associate classes is constructed through the use of a series of row-orthogonal matrices known as partially balanced orthogonal designs (PBOD) of m-associate classes. For the purpose, a series of PBOD is obtained through a method described herein. An infinite class of regular GD designs is also reported.     

On a class of partially balanced incomplete block designs

Bose and Clatworthy (1955) showed that the parameters of a two-class balanced incomplete block design with λ1=1,λ2=0 and satisfying r <k can be expressed in terms of just three parameters r,k,t. Later Bose (1963) showed that such a design is a partial geometry (r,k,t). Bose, Shrikhande and Singhi (1976) have defined partial geometric designs (r,k,t,c), which reduce to partial geometries when c=0. In this note we prove that any two class partially balanced (PBIB) design with r <k, is a partial geometric design for suitably chosen r,k,t,c and express the parameters of the PBIB design in terms of r,k,t,c and λ2. We also show that such PBIB designs belong to the class of special partially balanced designs (SPBIB) studied by Bridges and Shrikhande (1974).     

General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

On resolvable PBIB designs

Resolvable solutions for some two associate PBIB designs obtained by duplicating some non-resolvable designs are given. For the same designs 2-, 3- and 5-resolvable solutions are reported by Clatworthy (1973). A method of construction and some new resolvable PBIB designs obtained through this are given.     

A class of new pbib designs

Two series of PBIB designs, one with three associate classes and theother with four associate classes ars developed. Efficiency factors for two designs are computed.     

Comparison of Three Sampling Designs

Three sampling designs are considered for estimating the sum of k population means by the sum of the corresponding sample means. These are (a) the optimal design; (b) equal sample sizes from all populations; and (c) sample sizes that render equal variances to all sample means. Designs (b) and (c) are equally inefficient, and may yield a variance up to k times as large as that of (a). Similar results are true when the cost of sampling is introduced, and they depend on the population sampled.     

MULTI-FACTOR BALANCED BLOCK DESIGNS WITH COMPLETE ADJUSTED ORTHOGONALITY FOR ALL PAIRS OF TREATMENT FACTORS

A new series of multi-factor balanced block designs is introduced. Each of these designs has the following properties: (i) each of its k– 1 treatment factors is disposed in a cyclic or multi-cyclic balanced incomplete block design with parameters (v,b,r,k,Λ) = (a(k-l) + 1,a²(k-1) +a, ak, k, k) (a > 1); (ii) the incidence of any one of the treatment factors on any other is balanced; and (iii) after adjustment for blocks only, the relationship between any two of the treatment factors is that of adjusted orthogonality. The treatment factors are thus orthogonal to one another in the within-blocks stratum of the analysis of variance. The designs provide a benchmark with which other designs may be compared.     

Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition

In this article, a general method of construction of neighbor block designs is given. The designs are constructed using variation of a simple method which we refer to as the method of addition (renamed as the method of cyclic shifts). We give complete solution of neighbor balanced designs for k = 4 for any value of v. We also give many series of generalized neighbor designs (GNDs). In the last section, we have constructed GNDs in a sequential manner (as Did John 1981) for v ≤ 50 and r is multiple of k.     

A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.     

Tables of Cyclic Incomplete Block Designs: r=k

Initial blocks and efficiencies are given for cyclic incomplete block designs in the range t= 10(1)60 and r=k= 3(1)10. The designs have been selected by search procedures using optimality criteria which maximize the efficiency factor.     

Patterned constructions of partially ballvced incomplete block design

Starting from the incidence matrix of a BIB design, we obtain PBIB designs with two or three associate classes following certain patterns for their block structures .     

Construction of incomplete Sudoku square and partially balanced incomplete block designs

Abstract

The present article deals with the study of association among the elements of a Sudoku square. In this direction, we have defined an association scheme and constructed incomplete Sudoku square designs which are capable of studying four explanatory variables and also happen to be the designs for two-way elimination of heterogeneity. Some series of Partially Balanced Incomplete Block (PBIB) designs have also been obtained.     

m-Associate PBIB designs using Youden-m squares

In this paper, we have proposed a type of arrangement that we call Youden-m square and is similar to the usual Youden square but generates PBIB designs instead of BIB designs when its columns are taken as blocks. We have also discussed its construction methodologies, introduced two new m-associate class association schemes, and also constructed some series of Youden-m square type PBIB designs.     

CONSTRUCTION OF BALANCED TERNARY DESIGNS

In this paper variance balanced ternary designs are constructed in unequal block sizes for situations when suitable BIB designs do not exist for a given number of treatments because of the constraints bk=vr,and λ(v - 1) =r(k- 1).     

Pseudo New Modified Latin Square (NML m (m)) Type PBIB Designs

A New Modified Latin square [NML _i (m)] association scheme with i constraints for v = m ² treatments was introduced by Garg (2008 Garg , D. K. ( 2008 ). New modified Latin square (NMLi) type PBIB designs . J. Math. Syst. Sci. 1 ( 4 ): 83 – 89 . [Google Scholar]). In this article, a new association scheme known as Pseudo New Modified Latin square [Pseudo NML _m (m)] type association scheme is defined. The parameters of Pseudo NML _m (m) association scheme turned out to be parameters of NML _i (m) association scheme by taking i = m in NML _i (m) association scheme. The Pseudo NML _m (m) association scheme will be the usual NML _m (m) association scheme when m is a prime or a prime power. The PBIB designs following Pseudo NML _m (m) association scheme will be called the Pseudo NML _m (m) type PBIB designs. Analysis of Pseudo NML _m (m) designs along with a construction method of these designs is also given in this article.     

Three methods of constructing pbib designs

Three construction methods of two- or three-associate partially balanced incomplete block (PBIB) designs are presented.     

Construction of Efficient Multi-Level k-Circulant Supersaturated Designs

This article proposes an algorithm to construct efficient balanced multi-level k-circulant supersaturated designs with m factors and n runs. The algorithm generates efficient balanced multi-level k-circulant supersaturated designs very fast. Using the proposed algorithm many balanced multi-level supersaturated designs are constructed and cataloged. A list of many optimal and near optimal, multi-level supersaturated designs is also provided for m ≤ 60 and number of levels (q) ≤10. The algorithm can be used to generate two-level k-circulant supersaturated designs also and some large optimal two-level supersaturated designs are presented. An upper bound to the number of factors in a balanced multi-level supersaturated design such that no two columns are fully aliased is also provided.     

On the construction of m-associate PBIB designs I

The m-associate triangular association scheme has been discussed, and several series of partially balanced incomplete block (PBIB) designs with m-associate triangular association scheme have been obtained in Section 1. In Section 2, an m-associate triangular-group divisible association scheme $\text{(T}{}_{\mathrm{q}}\text{—}\text{GD}\text{m}\text{, 1<q<m)}$ has been introduced and several series of PBIB designs with m-associate triangular group divisible association scheme, from m-associate triangular PBIB designs have been constructed. Some numerical values to the three associate triangular designs, and three associate triangular group divisible designs in the range b, v≦100; r, k≦10, with their average efficiencies are given, respectively, in Tables I and II, in Section 3, where as usual v denotes the number of treatments, b the number of blocks, r the number of replications of each treatment, and k the block size.