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.     

Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

Partially balanced incomplete block designs with two associate classes

We provide constructions of cyclic 2-class PBIBD's using cyclotomy in finite fields. Our results give theoretical explanations of the two sporadic examples given by Agrawal (1987).     

On the block structure of proper block designs

In this paper we consider proper block designs and derive an upper bound for the number of blocks which can have a fixed number of symbols common with a given block of the design. To arrive at the desired bound, a generalization of an integer programming theorem due to Bush (1976) is first obtained. The integer programming theorem is then used to derive the main result of this paper. The bound given here is then compared with a similar bound obtained by Kageyama and Tsuji (1977).     

The Parshvanath yantram yields a constant-sum partially balanced incomplete block design

Yantrams have been used to generate mixture designs in the interior of a simplex. In this note, we show a connection between Parshvanath yantram and a particular partially balanced incomplete block design. This block design is rather special and somewhat unexpected due to the feature that sum of the treatment symbols in any block is constant.     

On the construction of balanced and orthogonal arrays

Two series of three symbol balanced arrays of strength two are constructed. Using special classes of BIB designs, two classes of two symbol orthogonal arrays of strength three are constructed.     

A note on the nonexistence of the constant block-sum balanced incomplete block designs

Abstract

Due to important practical applications and considerations in biomedical clinical trials, fixed block-sum designs are of interest. We show that in general, the constant block-sum balanced incomplete block designs do not exist.     

Super-simple group divisible designs with block size 4 and index 9

A design is said to be super-simple if the intersection of any two blocks has at most two elements. In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple GDDs are useful in constructing super-simple BIBDs. The existence of super-simple (4,λ)‐GDDs has been determined for λ=2-6. In this paper, we investigate the existence of a super-simple (4,9)-GDD of group type g^u and show that such a design exists if and only if u≥4, g(u−2)≥18 and u(u−1)g²≡0 (mod 4).     

Application of minque procedure to block designs

Method of minimum norm quadratic unbiased estimation (MINQUE) is applied to incomplete block designs. Simple formulae are derived for a class of designs which includes the balanced designs.     

A note on trend-free block designs

Trend-free and nearly trend-free block designs were developed to eliminate polynomial trends across the plots of experimental designs. Yeh, Bradley and Notz (1985) proved that certain nearly trend-free designs are A- and D-optimal in a subclass of all competing designs. This article extends that result by enlarging the class of designs for which the optimality holds, and by increasing the class of optimality criteria from A- and D-optimality to the class of all Schur-convex nonincreasing functions.     

An algorithm for constructing optimal resolvable incomplete block designs

This paper describes an efficient algorithm for the construction of optimal or near-optimal resolvable incomplete block designs (IBDs) for any number of treatments v < 100. The performance of this algorithm is evaluated against known lattice designs and the 414 or-designs of Patterson & Williams [36]. For the designs under study, it appears that our algorithm is about equally effective as the simulated annealing algorithm of Venables & Eccleston [42]. An example of the use of our algorithm to construct the row (or column) components of resolvable row-column designs is given.     

Balanced treatment incomplete block designs through integer programming

An algorithm is presented to construct balanced treatment incomplete block (BTIB) designs using a linear integer programming approach. Construction of BTIB designs using the proposed approach is illustrated with an example. A list of efficient BTIB designs for 2 ? v ? 12, v + 1 ? b ? 50, 2 ? k ? min(10, v), r ? 10, r₀ ? 20 is provided. The proposed algorithm is implemented as part of an R package.     

On Kronecker block designs for factorial experiments

In this paper the use of Kronecker designs for factorial experiments is considered. The two-factor Kronecker design is considered in some detail and the efficiency factors of the main effects and interaction in such a design are derived. It is shown that the efficiency factor of the interaction is at least as large as the product of the efficiency factors of the two main effects and when both the component designs are totally balanced then its efficiency factor will be higher than the efficiency factor of either of the two main effects. If the component designs are nearly balanced then its efficiency factor will be approximately at least as large as the efficiency factor of either of the two main effects. It is argued that these designs are particularly useful for factorial experiments.Extensions to the multi-factor design are given and it is proved that the two-factor Kronecker design will be connected if the component designs are connected.     

Mixture designs with orthogonal blocks

Constructions of blocked mixture designs are considered in situations where BLUEs of the block effect contrasts are orthogonal to the BLUEs of the regression coefficients. Orthogonal arrays (OA), Balanced Arrays (BAs), incidence matrices of balanced incomplete block designs (BIBDs), and partially balanced incomplete block designs (PBIBDs) are used. Designs with equal and unequal block sizes are considered. Also both cases where the constants involved in the orthogonality conditions depend and do not depend on the factors have been taken into account. Some standard (already available) designs can be obtained as particular cases of the designs proposed here.     

Approximate and exact distributions of rank tests for balanced incomplete block designs

Judges rank k out of t objects according to m replic ations of abasic balanced incomplete block design with bblocks. In Alvo and Cabilio(1991),it is shown that the Durbin test, which is the usual test in this situation, can be written in terms of Spearman correlations between the blocks, and using a Kendall correlation, they generated a new statistic for this situation.This Kendall tau based statistic has a richer support than the Durbin statistic, and is at least as efficient.In the present paper,exact and simulation based tables are generated for both statistics, and various approximations to these null distributions are considered and compared.     

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.     

Optimal two-level conjoint designs with constant attributes in the profile sets

We propose a simple strategy to construct D-, A-, G- and V-optimal two-level designs for rating-based conjoint studies with large numbers of attributes. In order to simplify the rating task, the designs hold one or more attributes at a constant level in each profile set. Our approach combines orthogonal designs and binary incomplete block designs with equal replication. The designs are variance-balanced meaning that they yield an equal amount of information on each of the part-worths.     

On a class of variance balanced incomplete block designs

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