D-optimal weighing designs for four and five objects
Let \(M_{j,d} (0,1)\) be the set of all \(j\times d\;(0,1)\) real matrices. For \(j=4,5\), and all \(d\geq j\), the authors determine the value of \(G(j,d)= \max\{ \text{det} AA^T: A\in M_{j,d} (0,1)\}\), and find matrices for which the maximum is attained. This maximization problem arises in at least two contexts -- finding \(D\)-optimal weighing designs for weighing four and five objects, and maximizing the volume of a \(j\)-simplex in the \(d\)-dimensional cube \([0,1]^d\). The results of this paper establish that lower bounds for \(G(j,d)\) derived by \textit{M. Hudelson}, \textit{V. Klee}, and \textit{D. Larman} [HKL] [Linear Algebra Appl. 241-243, 519-598 (1996; Zbl 0861.15004)] are in fact equal to \(G(j,d)\) for \(j=4,5\). The proof proceeds by first defining \[ S_{j,d} =\begin{cases} \bigl\{A\in M_{j,d} (0,1): e_jA= ke_d\bigr\} \quad & \text{if } j=2k-1\\ \bigl\{ A\in M_{j,d} (0,1): e_jA= ke_d\text{ or }(k+1) e_d\bigr\} \quad & \text{if }j= 3k, \end{cases} \] where \(e_n\) is the vector of all-ones of length \(n\), and \[ F(j, d)=\max \bigl\{\text{det} A A^T\mid A\in S_{j,d} (0,1)\bigr\}. \] It is then established that, for \(j=4\) and all \(d\geq 4\), every \(D\)-optimal matrix in \(M_{j, d}(0,1)\) is actually in \(S_{j,d} (0,1)\). Next, it is shown that \(G(5,d)= F(5,d)\) for all \(d\geq 5\), except perhaps for \(d=5\), 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 26, 27, 28, 33, 34, 35, 36, 37, 44, 45, 46. Finally, these exceptional cases are analyzed and it is proved that, in every case considered, the lower bounds for \(G(5,d)\) given in [HKL] are in fact equal to \(G(5,d)\). In the process the authors also find matrices \(A\) that attain the values of \(G(j,d)\) for \(j=4,5\) and all \(d\geq j\).
- D-optimal (0,1)-weighing designs for 10 objects
- D-optimal weighing designs for six objects.
- D-optimal \((0,1)\)-weighing designs for eight objects
- D-optimal Designs for Seven Objects and a Large Number of Weighings
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- Computing efficient exact designs of experiments using integer quadratic programming
- Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem
- Trace-minimal graphs and D-optimal weighing designs
- D-optimal Designs for Seven Objects and a Large Number of Weighings
- Highly D-efficient weighing designs for an even number of objects
- D-optimal (0,1)-weighing designs for 10 objects
- D-optimal weighing designs for six objects.
- The trace-minimal graph with \(2v\) vertices and regularity \(v+1\)
- D-optimal \((0,1)\)-weighing designs for eight objects
This page was built for publication: D-optimal weighing designs for four and five objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226767)
