On the enumeration of some D-optimal designs
| dc.creator | Orrick, William P. | |
| dc.date | 2005-11-06 | |
| dc.date | 2006-08-11 | |
| dc.date.accessioned | 2026-07-07T08:07:21Z | |
| dc.date.available | 2026-07-07T08:07:21Z | |
| dc.description | Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is known about the number of equivalence classes of matrices having maximal determinant. We establish that there are 7 equivalence classes for matrices of order 21 and that there are at least 9,884 equivalence classes for matrices of order 26. The latter result is obtained primarily using a switching technique for producing new designs from old. | |
| dc.description | 11 pages; Introduction rewritten; final section split into two and expanded slightly | |
| dc.identifier | https://arxiv.org/abs/math/0511141 | |
| dc.identifier | http://arxiv.org/abs/math/0511141 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130917 | |
| dc.subject | Combinatorics | |
| dc.subject | Statistics Theory | |
| dc.subject | 05B20, 05B30, 62K05 | |
| dc.title | On the enumeration of some D-optimal designs | |
| dc.type | text |