On the enumeration of some D-optimal designs

Details On the enumeration of some D-optimal designs On the enumeration of some D-optimal designs

2005-11-06

arxiv.org/abs/math/0511141v2

Mathematics

Combinatorics

11 pages; Introduction rewritten; final section split into two and expanded slightly

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the enumeration of some D-optimal designs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the enumeration of some D-optimal designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the enumeration of some D-optimal designs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-686911