Conjecture on the affine full-dimensionality of D-optimal factorial designs
Conjecture on the affine full-dimensionality of D-optimal factorial designs
Let denote the number of runs, and distinguish affinely full-dimensional factorial designs from subset fractional factorial designs. The D-optimal design conjecture. The -optimal design is affinely full-dimensional factorial when
and it is subset fractional factorial when
The conjecture records the periodicity observed in the table of known maximal determinants and predicts the type of -optimal design according to modulo . The source gives no resolution or status evidence.
Sources & referencesView supporting material
Primary source
Satoshi Aoki and Akimichi Takemura, “Some characterizations of affinely full-dimensional factorial designs”, arXiv:0812.0196 (2008).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.