## Designs 2002: Further Computational and Constructive Design TheoryThis volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

II | 1 |

III | 4 |

IV | 8 |

V | 23 |

VI | 24 |

VII | 27 |

VIII | 30 |

IX | 33 |

XL | 193 |

XLI | 207 |

XLII | 208 |

XLIII | 211 |

XLIV | 214 |

XLV | 218 |

XLVI | 227 |

XLVII | 229 |

X | 37 |

XI | 41 |

XII | 47 |

XIII | 48 |

XIV | 53 |

XV | 54 |

XVI | 56 |

XVII | 58 |

XVIII | 60 |

XIX | 62 |

XX | 69 |

XXI | 71 |

XXII | 73 |

XXIII | 75 |

XXIV | 81 |

XXV | 83 |

XXVI | 92 |

XXVII | 99 |

XXVIII | 103 |

XXIX | 104 |

XXX | 105 |

XXXI | 116 |

XXXII | 121 |

XXXIII | 124 |

XXXIV | 127 |

XXXV | 129 |

XXXVI | 133 |

XXXVII | 134 |

XXXVIII | 163 |

XXXIX | 176 |

XLVIII | 230 |

XLIX | 232 |

L | 235 |

LI | 238 |

LII | 240 |

LIII | 243 |

LIV | 246 |

LV | 247 |

LVI | 255 |

LVII | 257 |

LVIII | 260 |

LIX | 263 |

LX | 277 |

LXI | 279 |

LXII | 282 |

LXIII | 293 |

LXIV | 301 |

LXV | 302 |

LXVII | 306 |

LXVIII | 309 |

LXIX | 313 |

LXX | 314 |

LXXI | 317 |

LXXII | 318 |

LXXIII | 334 |

LXXIV | 342 |

LXXV | 348 |

LXXVI | 359 |

LXXVII | 363 |

### Other editions - View all

Designs 2002: Further Computational and Constructive Design Theory W.D. Wallis No preview available - 2012 |

### Common terms and phrases

2-HSOLSSOMs AG(d algorithm amicable sets automorphism group balanced ternary base blocks BIBD block design block size candidate arrays chromatic index Combinatorial Designs complete contains corresponding cosets critical set denote disjoint elements entry matrices Example exists Frame of type GDD of type given graph Hadamard matrices Hamming distance distribution hole hyperplane of H i i i i incidence matrix infinite point intersection isomorphism Kirkman Frame Kirkman Triple Systems Koukouvinos large sets latin trade Lemma matrices of order maximal set minimal defining set multiple non-isomorphic NPAF obtain occurs orthogonal design orthogonal STS pairs parameters partial latin square partition permutation prime power problem projections Proof proportionally balanced design resolvable satisfying Seberry Section sequences simulated annealing solutions square of order Steiner latin square Steiner triple systems subgroup subsets Suppose Sylow subgroup symmetric Hamming distance Theorem trade of volume trade volumes triangle-factors wsub