Related papers: Optimal BIBD-extended designs
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
Let $\mathcal D=(\Omega, \mathcal B)$ be a pair of $v$ point set $\Omega$ and a set $\mathcal B$ consists of $k$ point subsets of $\Omega$ which are called blocks. Let $d$ be the maximal cardinality of the intersections between the distinct…
Main effect plans orthogonal through the block factor (POTB) have been defined and a few series of them have been constructed in Bagchi (2010). These plans are very closely related to the `mutually orthogonal balanced nested row-column…
K-geodetic graphs (K capital) are defined as graphs in which each pair of nonadjacent vertices has at most K paths of minimum length between them. A K-geodetic graph is geodetic if K=1, bigeodetic if K=2 and trigeodetic if K=3. K-geodetic…
A weak $c$-colouring of a balanced incomplete block design (BIBD) is a colouring of the points of the design with $c$ colours in such a way that no block of the design has all of its vertices receive the same colour. A BIBD is said to be…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
We study the optimal design problem under second-order least squares estimation which is known to outperform ordinary least squares estimation when the error distribution is asymmetric. First, a general approximate theory is developed,…
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…
In this paper we study optimality aspects of a certain type of designs in a multi-way heterogeneity setting. These are ``duals" of plans orthogonal through the block factor (POTB). Here by the dual of a main effect plan (say $\rho$) we mean…
The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…
Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information…
Judging scholarly posters creates a challenge to assign the judges efficiently. If there are many posters and few reviews per judge, the commonly used Balanced Incomplete Block Design is not a feasible option. An additional challenge is an…
We study two types of nestings of balanced incomplete block designs (BIBDs). In both types of nesting, we wish to add a point (the nested point) to every block of a $(v,k,\lambda)$-BIBD in such a way that we end up with a partial…
A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $\lambda+1$ or $\lambda$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $\delta$-regular graph. Our paper describes a…
A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of…
In a tie-breaker design (TBD), subjects with high values of a running variable are given some (usually desirable) treatment, subjects with low values are not, and subjects in the middle are randomized. TBDs are intermediate between…
In this note we establish a 1-to-1 correspondence between the class of generalized quadrangles with ovoids and the class of balanced incomplete block designs that posses a non-triangular local resolution system and have the appropriate…
We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…
Modern experimental designs often face the so-called treatment cardinality constraint, which is the constraint on the number of included factors in each treatment. Experiments with such constraints are commonly encountered in engineering…
There have been some major advances in the theory of optimal designs for interference models. However, the majority of them focus on one-dimensional layout of the block and the study for two-dimensional interference model is quite limited…