Minimal neighbor designs in circular blocks of unequal sizes

Neighbor designs have their own importance in the experiments to remove the neighbor effects where the performance of a treatment is affected by the treatments applied to its adjacent plots. If each pair of distinct treatments appears exactly once as neighbors, neighbor designs are called minimal. Most of the neighbor designs require a large number of blocks of equal sizes. In this situation minimal neighbor designs in unequal block sizes are preferred to reduce the experimental material. In this article some series are presented to construct minimal neighbor designs in circular blocks of unequal sizes.     

Construction of Neighbor-Balanced Designs in Linear Blocks

Neighbor-balanced designs are useful to remove the neighbor effects in experiments where the performance of a treatment is affected by the treatments applied to its adjacent neighbors. In this article, neighbor-balanced designs are constructed in linear blocks of (i) equal sizes and (ii) two different sizes k ₁ and k ₂.     

Designs balanced for neighbor effects in circular blocks of size six

The performance of a treatment is affected by the treatments applied to its adjacent plots, especially in the experiments of agriculture, horticulture, forestry, serology and industry. Neighbor designs ensure that treatment comparisons are least affected by neighbor effects, therefore, this is a rich field of investigation in statistics and in combinatorics. In this article, several series of neighbor balanced designs are considered in circular blocks of six units.     

Non binary partially neighbor balanced designs for circular blocks

ABSTRACT

Neighbor designs are recommended for the cases where the performance of treatment is affected by the neighboring treatments as in biometrics and agriculture. In this paper we have constructed two new series of non binary partially neighbor balanced designs for v = 2n and v = 2n+1 number of treatments, respectively. The blocks in the design are non binary and circular but no treatment is ever a neighbor to itself. The designs proposed here are partially balanced in terms of nearest neighbors. No such series are known in the literature.     

Some Classes of Binary Block Neighbor Designs

Neighbor designs are useful to neutralize the neighbor effects. In this paper two classes of these designs are constructed in circular binary blocks of size 4, 8, …, 24. First class consists of six infinite series of nearest neighbor designs in which each pair of distinct treatments appears once as neighbors. Second class also deals with six infinite series of these designs in which each pair of distinct treatments appears twice as neighbors. A catalog of nearest neighbor designs is also compiled in circular binary blocks for odd number of treatments from 23 to 99.     

Families of proper generalized neighbor designs

A generalized neighbor design relaxes the equality condition on the number of times two treatments occur as neighbors in the design. In this article we have constructed a new series of generalized neighbor designs with equal block sizes, a series of neighbor designs of Rees [1967. Some designs of use in serology. Biometrics 23, 779–791] and a series of neighbor designs with two distinct block sizes. Two more new series of GN₂ designs are also constructed for even number of treatments. It has been shown that quasi neighbor designs introduced by Preece [1994. Balanced Ouchterlony neighbor designs. J. Combin. Math. Combin. Comput. 15, 197–219] are special cases of generalized neighbor designs with t=2$t=2$. All the designs given here are binary. A new definition—partially balanced circuit design is introduced which is a special case of generalized neighbor designs with binary blocks.     

Computer-Generated Neighbor Designs

Neighbor designs are useful to remove the neighbor effects. In this article, an algorithm is developed and is coded in Visual C + +to generate the initial block for possible first, second,…, and all order neighbor designs. To get the required design, a block (0, 1, 2,…, k ? 1) is then augmented with (v ? 1) blocks obtained by developing the initial block cyclically mod (v ? 1).     

Some series of proper generalized neighbor designs

Neighbor balanced designs are used to remove the neighbor effects but most of these designs require a large number of blocks. To neutralize the neighbor effects in such situations, GN₂-designs are most desirable. This article deals with the (i) refinement of some series of GN₂-designs constructed by Zafaryab et al. (2010) and (ii) construction of some new series of GN₂-designs in circular blocks of equal size.     

Generalized neighbor designs with block size 3

A generalized neighbor design relaxes the equality condition on the number of times two treatments as neighbors in the design. In this article, we have considered the construction of some classes of generalized neighbor designs with block size k=3 by using the method of cyclic shifts. The distinguishing feature of this construction method is that the properties of a design can easily be obtained from the sets of shifts instead of constructing the actual blocks of the design. A catalog of generalized neighbor designs with block size k=3 is compiled for v∈{5,6,…,18} treatments and for different replications. We provide the reader with a simpler method of construction, and in general the catalog that gives an open choice to the experimenter for selecting any class of neighbor designs.     

Proper generalized neighbor designs in circular blocks

Generalized neighbor designs relax the condition of constancy on the number of times two treatments occur as neighbors in a design. In this paper, we constructed generalized neighbor designs in circular blocks of equal size. Catalogs of these designs for block size 5, 7 and 9 are also compiled. All the designs given here are binary.     

Universally Optimal Designs Balanced for Neighbor Effects

The performance of a treatment is affected by the treatments applied to its adjacent plots, especially in the experiments of agriculture, horticulture, forestry, serology and industry. Neighbor designs ensure that treatment comparisons are least affected by neighbor effects, therefore, this is a rich field of investigation. In this paper, criterion for construction of universally optimal neighbor balanced designs is discussed.     

Simple constructions for minimal neighbor and GN2 designs in linear blocks

Minimal neighbor designs and GN₂ designs in linear blocks are constructed for all admissible parameter sets. The method is straightforward and uses subsequences of the LWW terrace as initial blocks from which the remaining blocks are generated.     

Non-binary neighbor balance circular designs for v=2n and λ=2

Neighbor balance designs were first introduced by Rees (1967) in circular blocks for the use in serological research. Subsequently several researchers have defined the neighbor designs in different ways. In this paper, neighbor balance circular designs for (k≤v) block size are constructed for even number of treatments i.e. v=2n. No such series of designs is known in literature. Two theorems are developed for circular designs. Theorem 1 gives the non-binary circular blocks, whereas Theorem 2 generates binary circular blocks when n≤4 and non-binary blocks for n>4. In suggested designs no treatment is ever a neighbor of itself. Blocks are constructed in such a way that each treatment is a right and left neighbor of every other treatment for a fixed number of times say λ. Sizes of initial circular blocks are not same. One main guiding principle for such designs is to ensure economy in material use.     

Circular Binary Block Second- and Higher-Order Neighbor Designs

Some new neighbor designs are presented here. Second-order neighbor designs for different configurations are generated in circular binary blocks. Third-order and fourth-order neighbor designs for some cases are also constructed. In all cases, circular blocks are well separated and these designs are obtained through initial block/s. At the end of the study, some models for analysis of these designs are also presented.     

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.     

Some important classes of generalized neighbor designs for linear blocks

In this paper, some infinite series of generalized neighbor designs are constructed for the linear blocks which are useful to balance out the neighbor effects for the cases where (a) one of the v treatments has some neighbor effects with other treatments, while remaining (v – 1) treatments have half of that neighbor effect among selves, (b) some of the v treatments have some neighbor effect with other treatments, while remaining treatments have half of that neighbor effect among themselves, (c) one of the v treatments has some neighbor effect with other treatments, while remaining (v – 1) treatments have double of that effect among themselves, and (d) some of the v treatments have some neighbor effect with other, while remaining treatments have double of it among themselves.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

A study of BIB designs through support matrices

This paper deals with the existence and nonexistence of BIB designs with repeated blocks. The approach is an algebraic one. The concept of a support matrix is introduced and some of its basic properties are noted. Some basic examples of support matrices are given when the block size is 3. The connection between full column rank proper support matrices and irreducible designs is explored and some examples of such matrices are given.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

A note on circular neighbor balanced designs

ABSTRACT

This paper describes some methods of constructing circular neighbor balanced and circular partially neighbor balanced block designs for estimation of direct and neighbor effects of the treatments. A class of circular neighbor balanced block designs with unequal block sizes is also proposed.