Optimality of block designs under the model with the firstorder circular autoregression
 248 Downloads
Abstract
In this paper optimal properties of some circular balanced block designs under the model with circular autoregression of order one are studied. Universal optimality of some balanced block designs with equal block sizes is proven and Eoptimality of complete balanced block designs with the number of blocks equal to the number of treatments or the number of treatments reduced by two is shown.
Keywords
Circular autoregression of order one Circular balanced block design Universal optimality Eoptimality Nondirectionally neighbor balanced design1 Introduction
The block experiments have been widely used in sciences, medical and engineering. The problem of universal optimality of block designs is widely studied for different correlation structures. Chai and Majumdar (2000) showed that under the nearest neighbor correlation structure the universally optimal block designs can be constructed from semibalanced arrays. Recently, Khodsiani and Pooladsaz (2017) characterized the universally optimal block designs under the hub correlation structure.
Under the standard block model in which correlation between observations in every block decreases exponentially with the distance, the firstorder linear autoregression covariance structure, AR(1, L), is considered in the literature. For some values of correlation parameter Kunert (1987) proved that the nearest neighbor balanced incomplete block designs, characterized by Gill and Shukla (1985), are universally optimal over the class of incomplete block designs. For positive correlations Pooladsaz and Martin (2005) extended the results of Kunert (1987) for the designs with block sizes exceeding the number of treatments. Kunert and Martin (1987b) extended the optimality results of some neighbor balanced designs for other autoregression correlation structures, such as e.g. circular autoregression (AR(1, C), defined in (2)) with positive correlation. Circular designs were considered for example by Rees (1967), in serological experiment in which treatments are arranged in circular blocks where every treatment has two neighbors. Another example is an experiment in marine biology in which five genotypes of bryozoan such that neighboring genotypes might interfere with each other were compared by suspending them in sea water around the circumference of a cylindrical tank; see Bayer and Todd (1996). One of the aims of this paper is to show universal optimality of some circular nondirectionally neighbor balanced designs under the model with AR(1, C) for positive and negative values of correlation coefficient.
Existence of universally optimal designs often has some limitations and for some combinations of design parameters the universally optimal designs can not exist. In such a case efficiency of some designs or optimality with respect to the specified criteria is considered. Ecriterion is one of the most popular criteria that can be studied in this case, as it minimizes the largest variance among all best linear unbiased estimators of normalized linear contrasts, and plays an important role in e.g. admissibility investigations; cf. Pukelsheim (2006). Although determining the Eoptimal designs is not easy especially when the observations are correlated because Ecriterion is based on the eigenvalues of the information matrix of designs. Jacroux (1982, 1983) characterized Eoptimal block designs for uncorrelated observations. Kunert and Martin (1987a) proved optimality of some neighbor designs with respect to the specific criteria, such as e.g. A, D or Eoptimality under the model with observations correlated according to AR(1, L) with positive correlation parameter.
According to the circular structure of AR(1, C), optimality problem of block designs under this correlation structure is similar to the determining optimal designs in interference models. There are several results on optimality of circular neighbor balanced designs (CNBDs) and orthogonal arrays of type I under the fixed and mixed interference models, where the observations are correlated or not (see e.g. Druilhet 1999; Filipiak and Markiewicz 2003, 2004, 2005, 2007). Similarly as Kunert and Martin (1987a) we will consider circular complete block designs (known also as William’s II(a) designs with extra plot). It is worth observing that designs with complete blocks are often used in practice. For example in UPOV (The International Union for the Protection of New Varieties of Plants) research, complete block designs are recommended in experiments when the number of treatments is less than 16. The designs with the same number of blocks as number of treatments and units are also applied in clinical trials.
Since complete CNBDs that are universally optimal under the interference models exist only for specific combinations of design parameters, one can look for universally optimal designs for some other combinations of parameters or to determine designs which are optimal with respect to other criteria, e.g. Eoptimality. Bailey et al. (2017) considered optimality of circular weakly neighbor balanced designs under the interference model. They showed the construction methods of such designs, mostly based on graph theory, and they applied Hamiltonian decomposition of matrices using GAP (2014) or Mathematica software. Nevertheless, numerical algorithms start to be not efficient for increasing number of treatments.
Regarding the circular block effects model with correlated errors and its connections to the interference model with uncorrelated errors, construction methods of Eoptimal designs are even more complicated, and numerical algorithms fails even for relatively small number of treatments. Nevertheless, algebraic concepts of construction methods based on the leftneighboring matrix of a circular design being an incidence matrix of some particular graph, can be used to more general models.
This paper is organized as follows. Section 2 introduces notation and definitions. Section 3 presents some results about universal optimality of designs under the standard block model for any size of blocks when the observation errors are correlated according to AR(1, C). In Sect. 4 some Eoptimal complete block designs are characterized.
2 Notation and definitions
In this paper we are interested in characterization of universally optimal design. Thus, let us denote as \(\mathbf{C}_d\) the information matrix of design d for estimation of treatment effects in the model (1). Due to Kiefer (1975, Proposition 1), if \(\mathbf{C}_d\mathbf{1}_t=\mathbf{0}_t\) for every \(d\in {\mathcal {D}}_{t,b,k}\) and if design \(d^*\) is such that \(\mathbf{C}_{d^*}\) is completely symmetric and has maximal trace over \({\mathcal {D}}_{t,b,k}\), then \(d^*\) is universally optimal among the class \({\mathcal {D}}_{t,b,k}\). Recall, that a \(t\times t\) matrix \(\mathbf{A}\) is completely symmetric, if all its diagonal elements are equal and all its offdiagonal elements are equal, that is \(\mathbf{A}=(\alpha \beta ) \mathbf{I}_t+\beta \mathbf{1}_t\mathbf{1}'_t\), \(\alpha ,\beta \in \mathbb R\).
Throughout this paper we use some properties of a balanced block design (BBD), i.e. such a design \(d\in \mathcal {D}_{t,b,k}\) for which (i) all \(n_{d,ij}=\lfloor k/t \rfloor \) or \(\lfloor k/t \rfloor +1\), (ii) all \(r_{d,i}\) are equal (say r), and (iii) every pair of distinct treatments occurs together in the same number of blocks (say \(\lambda \)), where \(\lfloor x \rfloor \) is the largest integer not exceeding x, \(r_{d,i}\) is the number of replications of the ith treatment in d, the ith diagonal entry of \(\mathbf{R}_d\), and \(n_{d,ij}\) is the (i, j)th entry \(\mathbf{N}_d\) (cf. Kiefer 1958). A BBD reduces to a balanced incomplete block design (BIBD) when \(k < t\). All designs satisfying (i) are called generalized binary designs (Das and Dey 1989), while designs satisfying (ii) are called equireplicated designs. The class of generalized binary designs with \(k\le t\) will be denoted by \({\mathcal {B}}_{t,b,k}\).
The following algebraic notation and definitions is used in Sect. 4 of the paper.
 (a)
\(n=1\) and \(\mathbf{A}=0\);
 (b)
\(n\ge 2\) and there is a permutation matrix \(\mathbf{P} \in {\mathcal {P}}_n\) and an integer u with \(1\le u\le n1\) such that \(\mathbf{P}'\mathbf{A}\mathbf{P}=\left( \begin{array}{cc} \mathbf{B}_{11} &{} \mathbf{B}_{12}\\ {\varvec{\Theta }} &{} \mathbf{B}_{22} \end{array}\right) \) where \(\mathbf{B}_{11}\in \mathbb R^{u\times u}\), \(\mathbf{B}_{12}\in \mathbb R^{u\times (nu)}\), \(\mathbf{B}_{22}\in \mathbb R^{(nu)\times (nu)}\) and \({\varvec{\Theta }}\) is an \((nu)\times u\) zero matrix.
Let \({\mathcal {P}}_{n}\) be the set of all permutation matrices of order n and let \( \overline{{\mathcal {P}}}_{n}\subset {\mathcal {P}}_{n}\) be the set of permutation matrices with zero diagonal (the set of derangement matrices of order n). The matrix \(\mathbf{P}'\!\mathbf{A}\mathbf{P}\), where \(\mathbf{P}\in {\mathcal {P}}_n\), is called permutationally similar to \(\mathbf{A}\). It is worth noting that the eigenvalues of \(\mathbf{A}\) and a matrix permutationally similar to \(\mathbf{A}\) are the same.
3 Universal optimality over the class \({\mathcal {D}}_{t,b,k}\)
If \(a=0\) there is no correlation structure in model (1) and it is known that every BBD is universally optimal over \({\mathcal {D}}_{t,b,k}\) (cf. Shah and Sinha 1989). In this section we characterize universally optimal designs under model (1) with AR(1, C) structure, where \(a\in (1,1)\backslash \{0\}\). We denote \(\overline{{\mathcal {D}}}_{t,b,k}\) as the subclass of \({\mathcal {D}}_{t,b,k}\) with no treatment preceded by itself.
Theorem 1
The circular BBD \(d^*\) such that \(\mathbf{S}_{d^*}^{}\!+\mathbf{S}'_{d^*}\) is completely symmetric with zero diagonal, is universally optimal under model (1) over the class \({\mathcal {D}}_{t,b,k}\) if \(a>0\), and over the class \(\overline{{\mathcal {D}}}_{t,b,k}\) if \(a<0\).
Proof
It is worth noting that for \(a=0\) and \(d\in {\mathcal {D}}_{t,b,k}\backslash {\mathcal {B}}_{t,b,k}\), \(\mathrm{tr}\mathbf{C}_{\mathrm{BBD}}>\mathrm{tr}\mathbf{C}_d\). Moreover, for \(k\le t\), \(\mathrm{tr}\mathbf{S}_{\mathrm{BBD}}=0\), and from continuity of the trace (as a function of a) it follows that for negative a, sufficiently close to 0, the BBD is universally optimal over the class \({\mathcal {D}}_{t,b,k}\). Moreover, for small number of treatments (e.g. \(t=k=3,4,5\)), the BBDs are universally optimal over the class \({\mathcal {D}}_{t,b,k}\) even for all negative a.
Universal optimality of CNBD2 under the wider model with AR(1, C), namely the onesided interference model, was shown in Filipiak and Markiewicz (2005).
4 Eoptimal complete block designs for \(b=t2\) and \(b=t\)
In this section we assume \(t\ge 3\). We denote the subclass of equireplicated designs of \({\mathcal {D}}_{t,b,k}\) by \({\mathcal {R}}_{t,b,k}\) and \(\overline{{\mathcal {R}}}_{t,b,k}\) consists of the equireplicated designs with no treatment preceded by itself.
The following lemmas will be useful for characterization of Eoptimal designs.
Lemma 1
 (i)
\(\mathbf{H}_n\) if \(n=2,7\);
 (ii)
\(\mathbf{I}_{2}\otimes \mathbf{H}_{2}\) or \(\mathbf{H}_{4}\) if \(n=4\);
 (iii)
\(\mathbf{I}_{m}\otimes \mathbf{H}_{3}\) if \(n=3m\), \(m\in \mathbb N\);
 (iv)
\(\mathrm{diag}\left( \mathbf{I}_i\otimes \mathbf{H}_3, \mathbf{I}_j\otimes \mathbf{H}_5\right) \) if \(n=5\) or \(n\ge 8\) and \(n\ne 3m\), \(m\in \mathbb N\) with \(n=3i+5j\) for some \(i\in \mathbb N\cup \lbrace 0\rbrace \) and \(j\in \mathbb N\),
Proof
From (6) the maximum of \(\lambda _n(\mathbf{P}+\mathbf{P}')\) is obtained for \(\mathbf{P}\in \overline{{\mathcal {P}}}_n\) permutationally similar to the blockdiagonal matrix with irreducible diagonal blocks of odd order as small as possible. Since \(n=5\) and every \(n\ge 8\) can be presented as \(3i+5j\) for some \(i,j\in \mathbb N\cup \{0\}\), we obtain (iii) and (iv). Moreover, for \(n=3i+5j\), \(j\not =0\), the maximum of \(\lambda _n(\mathbf{P}+\mathbf{P}')\) is equal to the maximum of \(\lambda _n(\mathbf{H}_5^{}+\mathbf{H}'_5)\), that is \(2\cos \left( 4\pi /5\right) \).
If \(n=2\) or 4 then any decomposition of n for odd numbers is possible and hence \(\lambda _n(\mathbf{P}+\mathbf{P}')=2\). Similarly, \(n=7\) cannot be decomposed for odd numbers and hence \(\displaystyle \max _{\tiny \mathbf{P}\in \overline{{\mathcal {P}}}_7} \lambda _7(\mathbf{P}+\mathbf{P}')=\lambda _7(\mathbf{H}_7^{}+\mathbf{H}'_7)=2\cos \left( 6\pi /7\right) \).
Lemma 2
If the derangement matrix \(\mathbf{P}\in \overline{{\mathcal {P}}}_n\) is permutationally similar to \(\mathbf{H}_n\), then the second maximal eigenvalue of \(\mathbf{P}+\mathbf{P}'\), that is \(\lambda _2(\mathbf{P}+\mathbf{P}')\), is minimal over \(\overline{{\mathcal {P}}}_n\).
Proof
From (5), \(\lambda _1(\mathbf{H}_n^{}+\mathbf{H}'_n)=2\) has multiplicity 1. For arbitrary reducible \(\mathbf{P}\in \overline{{\mathcal {P}}}_n\) permutationally similar to \(\mathrm{diag}(\mathbf{H}_{n_1},\ldots ,\mathbf{H}_{n_u})\), the largest eigenvalue \(\lambda _1(\mathbf{P}+\mathbf{P}')=2\) has multiplicity u. Thus, the matrix \(\mathbf{P}\in \overline{{\mathcal {P}}}_n\) which minimizes \(\lambda _2(\mathbf{P}+\mathbf{P}')\) has to be irreducible.
Similar results as in Lemmas 1 and 2 can be found in Filipiak et al. (2008).
4.1 Eoptimal complete block designs for \(b=t2\)
Theorem 2
 (i)
\(\mathbf{H}_t\) if \(t=2,7\);
 (ii)
\(\mathbf{I}_2\otimes \mathbf{H}_2\) or \(\mathbf{H}_4\) if \(t=4\);
 (iii)
\(\mathbf{I}_m\otimes \mathbf{H}_3\) if \(t=3m\), \(m\in \mathbb N\);
 (iv)
\(\mathrm{diag}\left( \mathbf{I}_{i}\otimes \mathbf{H}_3, \mathbf{I}_j\otimes \mathbf{H}_5\right) \) if \(t=5\) or \(t\ge 8\) and \(t\ne 3m\), \(m\in \mathbb N\) with \(t=3i+5j\) for some \(i\in \mathbb N\cup \lbrace 0\rbrace \) and \(j\in \mathbb N\);
Proof
Let \(a>0\). We prove the thesis in three steps.
Step 1. Let \(d\in \widetilde{{\mathcal {B}}}_{t,t2,t}\). We obtain the thesis by condition (9) and Lemma 1.
 (a)
Let \(\xi _{ij}\le 2\) for every \(i\ne j\). Then, there exists a design \(\widetilde{d}\in \widetilde{{\mathcal {B}}}_{t,t2,t}\) such that \(\mathbf{S}_d^{}+\mathbf{S}'_d=\mathbf{S}_{\tilde{d}}^{}+\mathbf{S}'_{\tilde{d}}\) and the thesis follows from Lemma 1.
 (b)Assume now that \(\xi _{ij}\in \lbrace 0,1,2,3\rbrace \) for every \(i\ne j\) and there exist at least one i and j such that \(\xi _{ij}=3\). We consider four cases separately.
 (b1)Let \(t\le 7\). Then there exists a submatrix of \(\mathbf{G}_d\) of the formsuch that \(\det (\mathbf{M}^{(1)})=3t(t8)<0\). From (7) \(\lambda _{t}(\mathbf{G}_d)\le \lambda _2(\mathbf{M}^{(1)})<0\). Since additionally \(\mathbf{G}_d\) is singular, \(\lambda _{t1}(\mathbf{G}_d)\le 0\) and (12) is satisfied trivially.$$\begin{aligned} \mathbf{M}^{(1)}=2(t2)\mathbf{1}_2^{}\mathbf{1}'_2t\left( \begin{matrix} \; 0 \; &{} \;3\;\\ 3 &{} 0 \end{matrix} \right) \end{aligned}$$
 (b2)Let \(t\ge 8\) and there exists at least one i and j, \(i\not =j\), such that \(\xi _{ij}=0\). Then we can find a submatrix of \(\mathbf{G}_d\) of the formfor which \(\mathrm{det}(\mathbf{M}^{(2)})=2(\xi _{ij}\xi _{i'j'})^2t^2(t2)\le 0\) for every \(t\ge 3\) and \(\xi _{ij},\xi _{i'j'}\in \{0,1,2,3\}\). Thus, \(\lambda _3(\mathbf{M}^{(2)})<0\) (also in the case \(\xi _{ij}=\xi _{i'j'}\), for which additionally \(\lambda _2(\mathbf{M}^{(2)})=0\)). From (7) \(\lambda _{t}(\mathbf{G}_d)\le \lambda _3(\mathbf{M}^{(2)})<0\). Since additionally one of the eigenvalue of \(\mathbf{G}_d\) is equal to zero, \(\lambda _{t1}(\mathbf{G}_d)\le 0\) and (12) is satisfied trivially.$$\begin{aligned} \mathbf{M}^{(2)}=2(t2)\mathbf{1}_3^{}\mathbf{1}'_3t\left( \begin{matrix} \;0\; &{} \;0\; &{} \;\xi _{ij}\;\\ 0 &{} 0 &{} \xi _{i'j'} \\ \;\xi _{ji}\; &{} \;\xi _{j'i'}\; &{} 0 \end{matrix}\right) \end{aligned}$$
 (b3)Let \(t\ge 8\) and there exist exactly one \(i\ne j\) such that \(\xi _{ij}=3\), and for every \(i\not =j\) we have \(\xi _{ij}\not =0\). Then we can find one of the submatrices of \(\mathbf{G}_d\) of the form:It is easy to calculate that \(\det (\mathbf{M}^{(3)})=12t^2<0\) for every t. From (7) \(\lambda _{t}(\mathbf{G}_d)\le \lambda _3(\mathbf{M}^{(3)})<0\). Since additionally \(\mathbf{G}_d\) is singular, \(\lambda _{t1}(\mathbf{G}_d)\le 0\) and (12) is satisfied trivially.$$\begin{aligned} \begin{array}{rcl} \mathbf{M}^{(3)}&{}=&{}2(t2)\mathbf{1}_3^{}\mathbf{1}'_3t\left( \begin{matrix} \;0\; &{} \;3\; &{} \;1\;\\ 3 &{} 0 &{} 1\\ 1 &{} 1 &{} 0 \end{matrix} \right) ,\\ \mathbf{M}^{(4)}&{}=&{}2(t2)\mathbf{1}_6^{}\mathbf{1}'_6t\left( \begin{matrix} \;0\; &{} \;3\; &{} \;1\; &{} \;1\; &{} \;2\; &{} \;2\;\\ 3 &{} 0 &{} 2 &{} 2 &{} 1 &{} 1\\ 1 &{} 2 &{} 0 &{} 2 &{} 2 &{} 2\\ 1 &{} 2 &{} 2 &{} 0 &{} 2 &{} 2\\ 2 &{} 1 &{} 2 &{} 2 &{} 0 &{} 2 \\ 2 &{} 1 &{} 2 &{} 2 &{} 2 &{} 0 \end{matrix} \right) \\ &{}=&{}2(t2)\mathbf{1}_6^{}\mathbf{1}'_6t\mathbf{V}^{(4)},\\ \mathbf{M}^{(5)}&{}=&{}2(t2)\mathbf{1}_8^{}\mathbf{1}'_8t\left( \begin{matrix} \;0\; &{} \;3\; &{} \;2\; &{} \;2\; &{} \;2\; &{} \;1\; &{} \;1\; &{} \;1\;\\ 3 &{} 0 &{} 1 &{} 1 &{} 1 &{} 2 &{} 2 &{} 2\\ 2 &{} 1 &{} 0 &{} 1 &{} 2 &{} 2 &{} 2 &{} 2\\ 2 &{} 1 &{} 1 &{} 0 &{} 2 &{} 2 &{} 2 &{} 2\\ 2 &{} 1 &{} 2 &{} 2 &{} 0 &{} 1 &{} 2 &{} 2 \\ 1 &{} 2 &{} 2 &{} 2 &{} 1 &{} 0 &{} 2 &{} 2\\ 1 &{} 2 &{} 2 &{} 2 &{} 2 &{} 2 &{} 0 &{} 1\\ 1 &{} 2 &{} 2 &{} 2 &{} 2 &{} 2 &{} 1 &{} 0 \end{matrix} \right) \\ &{}=&{}2(t2)\mathbf{1}_8^{}\mathbf{1}'_8t\mathbf{V}^{(5)}. \end{array} \end{aligned}$$
In two remaining cases it can be calculated that \(\mathbf{V}^{(u)}\), \(u=4,5\), is singular with \(\lambda _{2}(\mathbf{V}^{(u)})=0\). From (8) \(\lambda _2(\mathbf{S}_d^{}+\mathbf{S}'_d)\ge \lambda _2(\mathbf{V}^{(u)})=0\) and condition (11) is satisfied trivially.
 (b4)Let \(t\ge 8\) and there exist at least two pairs of indices \((i',j')\not =(i'',j'')\), such that \(\xi _{i'j'}=\xi _{i''j''}=3\), and for every \(i\not =j\) we have \(\xi _{ij}\not =0\). Then we can find one of the submatrices of \(\mathbf{G}_d\) of the form:or \(\mathbf{M}^{(3)}\). Observe, that the case with two 3s in one row is not excluded here, as more 3s bring some additional 1s. It can be calculated that \(\lambda _2(\mathbf{V}^{(u)})\ge 0\), \(u=6,7\), and again from (8) \(\lambda _2(\mathbf{S}_d+\mathbf{S}'_d)\ge \lambda _2(\mathbf{V}^{(u)})>0\) which satisfies condition (11) trivially. For \(\mathbf{M}^{(3)}\) the thesis follows as in (b3).$$\begin{aligned} \mathbf{M}^{(6)}= & {} 2(t2)\mathbf{1}_4^{}\mathbf{1}'_4t\left( \begin{matrix} \; 0 \; &{} \; 3 \; &{} \; 1 \; &{} \; 1\;\\ 3 &{} 0 &{} 2 &{} 2\\ 1 &{} 2 &{} 0 &{} 3\\ 1 &{} 2 &{} 3 &{} 0\\ \end{matrix} \right) =2(t2)\mathbf{1}_4^{}\mathbf{1}'_4t\mathbf{V}^{(6)} ,\\ \mathbf{M}^{(7)}= & {} 2(t2)\mathbf{1}_4^{}\mathbf{1}'_4t\left( \begin{matrix} \; 0 \; &{} \; 3 \; &{} \; 1 \; &{} \; 2\;\\ 3 &{} 0 &{} 2 &{} 1\\ 1 &{} 2 &{} 0 &{} 3\\ 2 &{} 1 &{} 3 &{} 0\\ \end{matrix} \right) =2(t2)\mathbf{1}_4^{}\mathbf{1}'_4t\mathbf{V}^{(7)} \end{aligned}$$
 (b1)
 (c)Let there exists at least one \(i\ne j\) such that \(\xi _{ij}=\xi \ge 4\). Then, we can find a submatrix of \(\mathbf{G}_d\) of the formfor which \(\lambda _1(\mathbf{M}^{(8)})=t\xi >0\) and \(\lambda _2(\mathbf{M}^{(1)})=8t(\xi 4)<0\) for every t. From (7) \(\lambda _{t}(\mathbf{G}_d)\le \lambda _2(\mathbf{M}^{(8)})< 0\). Since additionally one of the eigenvalue of \(\mathbf{G}_d\) is equal to zero, \(\lambda _{t1}(\mathbf{G}_d)\le 0\) and (12) is satisfied trivially.$$\begin{aligned} \mathbf{M}^{(8)}=2(t2)\mathbf{1}_2^{}\mathbf{1}'_2t \left( \begin{matrix} \; 0 \; &{} \; \xi \;\\ \xi &{} 0 \end{matrix}\right) \end{aligned}$$
 (i)
there exists at least one pair of unordered treatments that meet as the nearest neighbors three times,
 (ii)
every pair of unordered treatments appears as the nearest neighbors at most three times.

there exists exactly one pair (i, j) such that \(\xi _{ij}=3\) and at least one pair \((i',j')\) such that \(\xi _{i'j'}=0\).

there exists at least one pair (i, j) such that \(\xi _{ij}=3\) and at least one pair \((i',j')\) such that \(\xi _{i'j'}=0\).

for every \(i\ne j\), \(\xi _{ij}\ne 0\).
Theorem 3
 (i)
\(\overline{{\mathcal {R}}}_{t,t2,t}\) if \(t\le 6\),
 (ii)
\(\overline{{\mathcal {R}}}_{t,t2,t}\setminus {\mathcal {B}}_{t,t2,t}^{(3,1)}\) if \(t\ge 7\).
Proof
Let \(a<0\). We prove the thesis in three steps.
Step 1. Let \(d\in \widetilde{{\mathcal {B}}}_{t,t2,t}\). We obtain the thesis by condition (10) and Lemma 2.
 (a)
If the offdiagonal entries \(\xi _{ij}\le 2\) for every \(i\ne j\), then there exists a design \(\widetilde{d}\in \widetilde{{\mathcal {B}}}_{t,t2,t}\) such that \(\mathbf{S}_d^{}+\mathbf{S}'_d=\mathbf{S}_{\widetilde{d}}^{}+\mathbf{S}'_{\widetilde{d}}\) and the thesis follows from Lemma 2.
 (b)Assume that \(t\le 6\) and \(\xi _{ij}\in \lbrace 0,1,2,3\rbrace \) for every \(i\ne j\) and there exists at least one \(i\ne j\) such that \(\xi _{ij}=3\). Then we can find a submatrix of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) of the formfor which \(\lambda _2(\mathbf{M}^{(1)})=3\). From (8) we have \(\lambda _t(\mathbf{S}_d^{}+\mathbf{S}'_d)\le \lambda _2(\mathbf{M}^{(1)})=3\) and since \(\lambda _t(\mathbf{S}_{d^*}^{}+\mathbf{S}'_{d^*})\ge 3\) for \(t\le 6\) we obtain (13).$$\begin{aligned} \mathbf{M}^{(1)}=\left( \begin{matrix} \;0\; &{} \;3\;\\ 3 &{} 0 \end{matrix} \right) \end{aligned}$$
 (c)
Let \(t\ge 7\) and let \(d\in {\mathcal {B}}_{t,t2,t}^{(3,1)}\).
Assume that there is exactly one \(\xi _{d,i'j'}=0\), which is in the same row as 3, i.e., \(i'=i\). Because of the fixed sums of rows and columns of \(\mathbf{S}_d\), it can be observed that:Thus for every \(\mathbf{S}_d^{}+\mathbf{S}'_d\) there exists a submatrix
\((t4)\) offdiagonal entries of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) must be equal to 2, one entry is equal to 0, one is equal to 1 and one is equal to 3 in the ith row;

\((t5)\) offdiagonal entries of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) must be equal to 2, three are equal to 1 and one is equal to 3 in the jth row;

\((t2)\) offdiagonal entries of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) must be equal to 2, and one is equal to 0 in the row \(j'\);

\((t3)\) offdiagonal entries of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) must be equal to 2 and two are equal to 1 in the remaining rows.
for which \(\lambda _4(\mathbf{M}^{(2)})=4.11\). From (8) \(\lambda _t(\mathbf{S}_d^{}+\mathbf{S}'_d)\le \lambda _4(\mathbf{M}^{(2)})<4\le \lambda _{t}(\mathbf{S}_{d^*}^{}+\mathbf{S}'_{d^*})\).$$\begin{aligned} \mathbf{M}^{(2)}=\left( \begin{matrix} \;0\; &{} \;3\; &{} \;0\; &{} \;2\;\\ 3 &{} 0 &{} 2 &{} 1\\ 0 &{} 2 &{} 0 &{} 2\\ 2 &{} 1 &{} 2 &{} 0 \end{matrix}\right) \end{aligned}$$Assume now that there is exactly one \(\xi _{d,i'j'}=0\), which is in different row than 3, i.e., \(i'\not =i\). Then, we can find a submatrix of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) permutationally similar toMoreover, in the row \(i'\) the only possible offdiagonal entries different than 0 are 2s. Thus, one of the eigenvectors of \(\mathbf{S}_{d}^{}+\mathbf{S}'_{d}\) is of the form \((\alpha _1\mathbf{1}'_2:\alpha _2\mathbf{1}'_{t2})'\) and it corresponds to the – 4 egienvalue of \(\mathbf{S}_d^{}+\mathbf{S}'_d\). From (8) we obtain the thesis.$$\begin{aligned} \mathbf{M}^{(3)}=\left( \begin{matrix} \;0\; &{} \;0\;&{} \;2\; &{} \;2\; \\ \;0\; &{} \;0\;&{} \;2\; &{} \;2\; \\ \; 2\; &{} \;2\; &{} \;0\; &{} \;3\; \\ \;2\; &{} \;2 \; &{} \;3\; &{} \;0\; \end{matrix}\right) . \end{aligned}$$Let now assume that there exist at least two pairs of indices \((i',j')\), \((i'',j'')\) such that \(\xi _{i'j'}=\xi _{i''j''}=0\). Observe that the only possible situation is \(i'\not =i''\) and \(j'\not =j''\). Thus, there are one offdiagonal 0 in rows \(j'\), \(j''\) with the remaining elements offdiagonal entries are equal to 2. Hence, there exist a submatrix of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) of the formfor which \(\lambda _{4}(\mathbf{M}^{(4)})=4\). From (8) we obtain the thesis.$$\begin{aligned} \mathbf{M}^{(4)}=\left( \begin{matrix} \;0\; &{} \;3\; &{} \;0\; &{} \;2\; \\ 3\; &{} \;0\; &{} \;2\; &{} \;0\; \\ 0\; &{} \;2\; &{} \;0\; &{} \;2\; \\ 2\; &{} \;0\; &{} \;2\; &{} \;0\; \end{matrix}\right) \end{aligned}$$ 
 (d)Let there exist at least one i, j such that \(\xi _{ij}\ge 4\). Then there exists a submatrixfor which \(\lambda _2(\mathbf{M}^{(3)})=\xi _{ij}\le 4\). By (8), \(\lambda _t(\mathbf{S}_d^{}+\mathbf{S}'_d)\le \lambda _2(\mathbf{M}^{(2)})\le 4\) and (13) is satisfied.$$\begin{aligned} \mathbf{M}^{(2)}=\left( \begin{matrix} 0 &{} \xi _{ij}\\ \xi _{ij} &{} 0 \end{matrix}\right) \end{aligned}$$

the highest \(\lambda _{7}(\mathbf{S}_d^{}+\mathbf{S}'_d)\) over \(d\in \widetilde{{\mathcal {B}}}_{7,5,7}\) is \(3.8\);
 if there exist at least one i, j, such that \(\xi _{ij}\ge 3\) then we can find a submatrixfor which \(\lambda _2(\mathbf{M}_d)=\xi _{ij}\le 3\);$$\begin{aligned} \mathbf{M}_d=\left( \begin{matrix} 0 &{} \xi _{ij} \\ \xi _{ji} &{} 0 \end{matrix} \right) \end{aligned}$$

optimality over the class \(\overline{{\mathcal {R}}}_{7,5,7}\) follows directly from Theorem 3.
Example 1
It is worth noting that Eoptimal designs presented in Theorem 3 are also Eoptimal under the onesided interference model with uncorrelated observations (cf. Filipiak et al. 2008) and thus, some of the construction methods of Eoptimal designs can be adopted.
4.2 Eoptimal complete block designs for \(b=t\)
 (i)
there exists at least one pair of unordered treatments that meet as the nearest neighbors once,
 (ii)
every pair of unordered treatments appears as the nearest neighbors at least once and at most three times.
Theorem 4
 (i)
\(\overline{{\mathcal {R}}}_{t,t,t}\) if \(t\le 6\),
 (ii)
\(\overline{{\mathcal {R}}}_{t,t,t}\setminus {\mathcal {B}}_{t,t,t}^{(1)}\) if \(t\ge 7\).
Proof
Let \(a>0\). We prove the thesis in three steps.
Step 1. Let \(d\in \widehat{{\mathcal {B}}}_{t,t,t}\). The thesis follows from (14) and Lemma 2.
 (a)
Let \(\xi _{ij}\in \lbrace 2,3,4\rbrace \) for every \(i\not = j\). Thus, there exists \(\hat{d}\in \widehat{{\mathcal {B}}}_{t,t,t}\) such that \(\mathbf{S}_{d}^{}+\mathbf{S}'_{d}=\mathbf{S}_{\hat{d}}^{}+\mathbf{S}'_{\hat{d}}\) and the thesis follows from Lemma 2.
 (b)
Let \(\xi _{ij}\in \lbrace 0,1,2,3,4\rbrace \) for every \(i\not = j\). Assume that there exists at least one pair (i, j) such that \(\xi _{ij}=0\). Then there exists a \(2\times 2\) zero submatrix of \(\mathbf{S}_d^{}+\mathbf{S}'_d\), for which trivially the eigenvalues are equal to 0. From (8) we obtain the thesis.
 (c)Assume now that \(\xi _{ij}\in \lbrace 1,2,3,4\rbrace \) for every \(i\not = j\) and there exists at least one pair \((i',j')\) such that \(\xi _{i'j'}=1\). We cosider two cases separetely.
 (c1)Let \(t\le 6\) and let \(\xi _{ij}\in \{1,2,3\}\) for every \(i,j=1,\ldots , t\). Since the rows and columns of \(\mathbf{Q}_d\) sum to zero and the diagonal entries are equal to 2, there exists a submatrix of \(\mathbf{Q}_d\) of the formFrom (7) we have \(\lambda _{t1}(\mathbf{Q}_d)\le \lambda _{2}(\mathbf{M}^{(1)})=1\le 2\left( 1\cos \left( \frac{2\pi }{t}\right) \right) = \lambda _{t1}(\mathbf{Q}_{d^{*}})\).$$\begin{aligned} \mathbf{M}^{(1)}=2\mathbf{1}_3^{}\mathbf{1}'_3\left( \begin{matrix} \;0\; &{} \;1\; &{} \;3\;\\ 1 &{} 0 &{} 3\\ 3 &{} 3 &{} 0 \end{matrix} \right) . \end{aligned}$$
 (c2)Let \(t\ge 3\) and \(d\in {\mathcal {B}}_{t,t,t}\setminus {\mathcal {B}}_{t,t,t}^{(1)}\). It means that \(\xi _{ij}\in \{1,2,3,4\}\) and there exists at least one pair (i, j) such that \(\xi _{ij}= 4\). Then we can find a submatrix of \(\mathbf{Q}_d\) of the formwith \(\xi _{m}\in \lbrace 1,2,3,4\rbrace \), \(m=1,2,3,4\). It is easy to verify that \(\det (\mathbf{M}^{(2)})< 0\) for every \(\xi _m\). It implies that there exists at least one negative eigenvalue of \(\mathbf{M}^{(2)}\) (and from (7) also of \(\mathbf{Q}_d\)). Since one of the eigenvalues of \(\mathbf{Q}_d\) is zero we obtain that \(\lambda _{t1}(\mathbf{Q}_d^{})\le 0\le \lambda _{t1}(\mathbf{Q}_d^*)\).$$\begin{aligned} \mathbf{M}^{(2)}=2\mathbf{1}_4^{}\mathbf{1}'_4\left( \begin{matrix} \;0\; &{} \;1\;&{} \;4\; &{} \;\xi _{1}\;\\ \;1\; &{} \;0\;&{} \;\xi _{2}\; &{} \;\xi _{3}\; \\ \; 4\; &{} \;\xi _2\; &{} 0 &{} \; \xi _{4}\;\\ \;\xi _{1}\; &{} \;\xi _{3} \; &{} \;\xi _{4}\; &{} \;0\; \end{matrix}\right) . \end{aligned}$$
 (c1)
 (d)Let there exist at least one pair (i, j) such that \(\xi _{ij}\ge 5\). Then there exists a submatrixSince \(\det (\mathbf{M}^{(3)})<0\) the thesis is proved by the same lines as in (c2).$$\begin{aligned} \mathbf{M}^{(3)}=2\mathbf{1}_2^{}\mathbf{1}'_2\left( \begin{matrix} \;0\; &{} \;\xi _{ij}\;\\ \xi _{ji} &{} 0 \end{matrix}\right) . \end{aligned}$$

the smallest \(\lambda _{2}(\mathbf{S}_d^{}+\mathbf{S}'_d)\) over \(d\in \widehat{{\mathcal {B}}}_{7,5,7}\) is \(0.75\);

if \(\xi _{ij}\in \lbrace 1,2,3\rbrace \) and there exists at least one pair (i, j), such that \(\xi _{ij}=1\). Then we can find submatrix \(\mathbf{1}_2^{}\mathbf{1}'_2\mathbf{I}_2\) of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) for which \(\lambda _{2}(\mathbf{1}_2^{}\mathbf{1}'_2\mathbf{I}_2)= 1\). By (8) we obtain \(\lambda _{2}(\mathbf{S}_d^{}+\mathbf{S}'_d)\ge 1=\lambda _{2}(\mathbf{S}_{d^{\#}}^{}+\mathbf{S}'_{d^\#})\) and finally \(\lambda _{6}(\mathbf{C}_{d}^{})\le \lambda _{6}(\mathbf{C}_{d^\#})\);

optimality over the class \(\overline{{\mathcal {R}}}_{7,7,7}\) follows directly from Theorem 4.
Theorem 5
 (i)
\(\mathbf{H}_{t}\) if \(t=2,7\);
 (ii)
\(\mathbf{I}_{2}\otimes \mathbf{H}_{2}\) or \(\mathbf{H}_{4}\) if \(t=4\);
 (iii)
\(\mathbf{I}_{m}\otimes \mathbf{H}_{3}\) if \(t=3m\), \(m\in \mathbb N\);
 (iv)
\(\mathrm{diag}\left( \mathbf{I}_{i}\otimes \mathbf{H}_{3}, \mathbf{I}_{j}\otimes \mathbf{H}_{5}\right) \) if \(t=5\) or \(t\ge 8\) and \(t\ne 3m\), \(m\in \mathbb N\) with \(t=3i+5j\) for some \(i\in \mathbb N\cup \lbrace 0\rbrace \) and \(j\in \mathbb N\);
Proof
Let \(a<0\). We prove the thesis in three steps.
Step 1. Let \(d\in \widehat{{\mathcal {B}}}_{t,t,t}\). The thesis follows from (15) and Lemma 1
 (a)
Let \(\xi _{ij}\in \lbrace 2,3\rbrace \) for every \(i\not = j\). Thus, there exists \(\hat{d}\in \widehat{{\mathcal {B}}}_{t,t,t}\) such that \(\mathbf{S}_{d}^{}+\mathbf{S}'_{d}=\mathbf{S}_{\hat{d}}^{}+\mathbf{S}'_{\hat{d}}\) and the thesis follows from Lemma 1.
 (b)Let there exists at least one pair \(i\ne j\) such that \(\xi _{ij}\in \lbrace 0,4,5,\ldots ,t\rbrace \). Then we can find a submatrixfor which \(\lambda _{1}(\mathbf{M}^{(1)})\ge 4\). By (8) we have \(\lambda _{1}(\mathbf{Q}_d)\ge \lambda _{1}(\mathbf{M}^{(1)})\ge 4\ge \lambda _{1}(\mathbf{Q}_{d^*})\).$$\begin{aligned} \mathbf{M}^{(1)}=2\mathbf{1}_2^{}\mathbf{1}'_2\left( \begin{matrix} \;0\; &{} \;\xi _{ij}\;\\ \xi _{ij} &{} 0 \end{matrix}\right) \end{aligned}$$
 (c)Assume now that \(\xi _{ij}\in \lbrace 1,2,3\rbrace \) for every \(i\not = j\) and there exists at least one pair (i, j) such that \(\xi _{ij}=1\). Because of the fixed sums of rows and columns of \(\mathbf{S}_d\), it can be observed that:Due to these observations we consider two cases.

if there exists exactly one 1 in a row of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) then there are \((t5)\) offdiagonal entries of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) equal to 2 and three entries equal to 3 in this row;

if there exist more than one 1 in a row of \(\mathbf{S}_d^{}+\mathbf{S}'_d\) then there are more than three entries equal to 3 in this row.
 (c1)If there exists exactly one pair of \(i\ne j\) such that \(\xi _{ij}=1\), then we find one of the following submatrices of \(\mathbf{Q}_d\):It can be calculated that \(\lambda _1(\mathbf{M}^{(m)})=4\) for \(m=2,3,4\). Thus by (8) inequality (16) is satisfied.$$\begin{aligned}&\displaystyle \mathbf{M}^{(2)} = 2\mathbf{1}_3^{}\mathbf{1}'_3\left( \begin{matrix} \;0\; &{} \;1\; &{} \;3\;\\ 1 &{} 0 &{} 3\\ 3 &{} 3 &{} 0 \end{matrix} \right) ,\\&\displaystyle \mathbf{M}^{(3)}=2\mathbf{1}_5^{}\mathbf{1}'_5\left( \begin{matrix} \;0\; &{} \;1\; &{} \;2\; &{} \;2\; &{} \;3\;\\ 1 &{} 0 &{} 3 &{} 2 &{} 2\\ 2 &{} 3 &{} 0 &{} 3 &{} 2\\ 2 &{} 2 &{} 3 &{} 0 &{} 3\\ 3 &{} 2 &{} 2 &{} 3 &{} 0 \end{matrix} \right) ,\\&\displaystyle \mathbf{M}^{(4)}=2\mathbf{1}_8^{}\mathbf{1}'_8\left( \begin{matrix} \;0\; &{} \;1\; &{} \;3\; &{} \;3\; &{} \;3\; &{} \;2\; &{} \;2\; &{} \;2\;\\ 1 &{} 0 &{} 2 &{} 2 &{} 2 &{} 3 &{} 3 &{} 3\\ 3 &{} 2 &{} 0 &{} 3 &{} 2 &{} 2 &{} 2 &{} 2\\ 3 &{} 2 &{} 3 &{} 0 &{} 2 &{} 2 &{} 2 &{} 2\\ 3 &{} 2 &{} 2 &{} 2 &{} 0 &{} 3 &{} 2 &{} 2\\ 2 &{} 3 &{} 2 &{} 2 &{} 3 &{} 0 &{} 2 &{} 2\\ 2 &{} 3 &{} 2 &{} 2 &{} 2 &{} 2 &{} 0 &{} 3\\ 2 &{} 3 &{} 2 &{} 2 &{} 2 &{} 2 &{} 3 &{} 0 \end{matrix} \right) . \end{aligned}$$
 (c2)If there exists more than one pair of \(i\ne j\) such that \(\xi _{ij}=1\), then we can find one of the submatrices of (c1) or:It can be calculated that \(\lambda _1(\mathbf{M}^{(m)})\ge 4\) for \(m=5,6,7\). Thus by (8) inequality (16) is satisfied. \(\square \)$$\begin{aligned} \mathbf{M}^{(5)}= & {} 2\mathbf{1}_4^{}\mathbf{1}'_4\left( \begin{matrix} \;0\; &{} \;1\; &{} \;3\; &{} \;2\;\\ 1 &{} 0 &{} 2 &{} 3\\ 3 &{} 2 &{} 0 &{} 1\\ 2 &{} 3 &{} 1 &{} 0 \end{matrix}\right) ,\\ \mathbf{M}^{(6)}= & {} 2\mathbf{1}_4^{}\mathbf{1}'_4\left( \begin{matrix} \;0\; &{} \;1\; &{} \;3\; &{} \;3\;\\ 1 &{} 0 &{} 2 &{} 2\\ 3 &{} 2 &{} 0 &{} 1\\ 3 &{} 2 &{} 1 &{} 0 \end{matrix}\right) ,\\ \mathbf{M}^{(7)}= & {} 2\mathbf{1}_6^{}\mathbf{1}'_6\left( \begin{matrix} \;0\; &{} \;1\; &{} \;3\; &{} \;3\; &{} \;2\; &{} \;2\;\\ 1 &{} 0 &{} 2 &{} 2 &{} 3 &{} 3\\ 3 &{} 2 &{} 0 &{} 2 &{} 2 &{} 2\\ 3 &{} 2 &{} 2 &{} 0 &{} 2 &{} 2\\ 2 &{} 3 &{} 2 &{} 2 &{} 0 &{} 2\\ 2 &{} 3 &{} 2 &{} 2 &{} 2 &{} 0 \end{matrix}\right) . \end{aligned}$$

It is worth noting that Eoptimal designs presented in Theorem 5 are also Eoptimal under the onesided interference model with uncorrelated observations [cf. Filipiak et al. (2008)] and thus, some of the construction methods of Eoptimal designs can be adopted from Filipiak et al. (2008) or Filipiak and Różański (2005). Moreover, for \(a>0\) Eoptimal designs can be constructed from CNBDs by repeating one block.
Example 2
5 Concluding remarks
In the paper universal optimality of some circular NdNBD designs over the class of circular designs with arbitrary block size under AR(1, C) and \(a>0\) is shown. For \(a<0\) universal optimality of these designs over the class of circular designs with no treatment preceded by itself is proven. The only limitation on design parameters in this case is the existence of BBD design with completely symmetric nondirected neighboring matrix.
If a circular universally optimal BBD cannot exist, Eoptimality is considered in the class of complete block designs. If the number of blocks is smaller by two than the number of treatments and the correlation parameter a is positive as well as if the number of blocks is equal to the number of treatments and the correlation parameter is negative, the leftneighboring matrix of an Eoptimal design over the class of all equireplicated designs without selfneighbors is given. In the remaining cases the class of optimality is more limited, however, we conjecture that the designs with leftneighboring matrices presented in Theorems 3 and 4 are still optimal over at least the class of equireplicated designs with no treatment preceded by itself.
In all the cases at least one example of Eoptimal design is given. To construct such designs one can regard the leftneighboring matrix as an adjacency matrix of a directed graph and use its decomposition into Hamiltonian cycles. Such a decomposition can be done for example with the use of FindHamiltonianCycles procedure available in Mathematica 9.0 and later versions. The problem however is that looking for such a decomposition is extremely timeconsuming even for relatively small number of treatments (vertices in graphs). Therefore some combinatorial methods of construction of Eoptimal designs will be subject of the future research. It is especially interesting because optimal designs in the standard block effects model with observations correlated with respect to circular autoregression can be also shown to be optimal in more general models, e.g. with carryover effects as additional nuisance parameters.
Notes
Acknowledgements
This research is partially supported by Statutory Activities (K. Filipiak).
References
 Azaïs JM, Bailey RA, Monod H (1993) A catalogue of efficient neighbourdesigns with border plots. Biometrics 49:1252–1261CrossRefGoogle Scholar
 Bailey RA, Cameron PJ, Filipiak K, Kunert J, Markiewicz A (2017) On optimality and construction of circular repeatedmeasurements designs. Stat Sin 27:1–22MathSciNetzbMATHGoogle Scholar
 Bayer MM, Todd CD (1996) Effect of polypide regression and other parameters on colony growth in the cheilostomate Electra pilosa (L.). In: Gordon DP, Smith AM, GrantMackie JA (eds) Bryozoans in space and time. National Institute of Water and Atmospheric Research, Wellington, NZ, pp 29–38Google Scholar
 Chai FS, Majumdar D (2000) Optimal designs for nearestneighbor analysis. J Stat Plan Inference 86:265–275MathSciNetCrossRefzbMATHGoogle Scholar
 Das A, Dey A (1989) A note on balanced block designs. J Stat Plan Inference 22:256–268MathSciNetCrossRefzbMATHGoogle Scholar
 Druilhet P (1999) Optimality of circular neighbour balanced designs. J Stat Plan Inference 81:141–152MathSciNetCrossRefzbMATHGoogle Scholar
 Filipiak K, Różański R, Sawikowska A, WojteraTyrakowska D (2008) On the Eoptimality of complete designs under an interference model. Stat Probab Lett 78:2470–2477MathSciNetCrossRefzbMATHGoogle Scholar
 Filipiak K, Markiewicz A (2003) Optimality of circular neighbor balanced designs under mixed effects model. Stat Probab Lett 61:225–234CrossRefzbMATHGoogle Scholar
 Filipiak K, Markiewicz A (2004) Optimality of type I orthogonal arrays for general interference model with correlated observations. Stat Probab Lett 68:259–265MathSciNetCrossRefzbMATHGoogle Scholar
 Filipiak K, Markiewicz A (2005) Optimality and efficiency of circular neighbor balanced designs for correlated observations. Metrika 61:17–27MathSciNetCrossRefzbMATHGoogle Scholar
 Filipiak K, Markiewicz A (2007) Optimal designs for a mixed interference model. Metrika 65:369–386MathSciNetCrossRefzbMATHGoogle Scholar
 Filipiak K, Różański R (2005) Eoptimal designs under an interference model. Biom Lett 42(2):133–142Google Scholar
 Gill PS, Shukla GK (1985) Efficiency of nearest neighbour balanced block designs for correlated observations. Biometrika 72:539–544MathSciNetCrossRefGoogle Scholar
 Jacroux M (1982) Some Eoptimal designs for the oneway and twoway elimination of heterogeneity. J R Stat Soc B 44:253–261MathSciNetzbMATHGoogle Scholar
 Jacroux M (1983) On the Eoptimality of block designs. Sankhya Ser B 45:351–361MathSciNetzbMATHGoogle Scholar
 Kiefer J (1958) On the nonrandomized optimality and randomized nonoptimality of symmetrical designs. Ann Math Stat 29:675–699MathSciNetCrossRefzbMATHGoogle Scholar
 Kiefer J (1975) Construction and optimality of generalised Youden designs. In: Srivastava JN (ed) A survey of statistical design and linear models. North Holland, Amsterdam, pp 333–353Google Scholar
 Kiefer J, Wynn H (1981) Optimum balanced block and latin square designs for correlated observations. Ann Stat 9:737–757MathSciNetCrossRefzbMATHGoogle Scholar
 Khodsiani R, Pooladsaz S (2017) Universal optimal block designs under hub correlation structure. Stat Probab Lett 129:387–392MathSciNetCrossRefzbMATHGoogle Scholar
 Kunert J (1987) Neighbour balanced block designs for correlated errors. Biometrika 74:717–724MathSciNetCrossRefzbMATHGoogle Scholar
 Kunert J, Martin R (1987) On the optimality of finite Williams type II designs. Ann Stat 15:1604–1628CrossRefzbMATHGoogle Scholar
 Kunert J, Martin R (1987) Some results on optimal design under a firstorder autoregression and on finite Williams type II designs. Commun Stat Theory Methods 16:1901–1922MathSciNetCrossRefzbMATHGoogle Scholar
 Marshall AW, Olkin I, Arnold BC (2011) Inequalities: theory of majorization and its applications, 2nd edn. Springer, BerlinCrossRefzbMATHGoogle Scholar
 Pooladsaz S, Martin RJ (2005) Optimal extended complete block designs for dependent observations. Metrika 61:185–197MathSciNetCrossRefzbMATHGoogle Scholar
 Pukelsheim F (2006) Optimal design of experiments. Siam, PhiladelphiaCrossRefzbMATHGoogle Scholar
 Rees DH (1967) Some designs of use in serology. Biometrics 23:779–791CrossRefGoogle Scholar
 Shah KR, Sinha BK (1989) Theory of optimal designs. Springer, New YorkCrossRefzbMATHGoogle Scholar
 The GAP Group (2014) GAP—groups, algorithms, and programming, Version 4.7.4. http://www.gapsystem.org
Copyright information
OpenAccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.