| Designs 2002: Further Computational and Constructive Design Theory Contributor(s): Wallis, W. D. (Editor) |
|
 |
ISBN: 1402075995 ISBN-13: 9781402075995 Publisher: Springer OUR PRICE: $52.24 Product Type: Hardcover - Other Formats Published: September 2003 Annotation: This volume is a sequel to the 1996 compilation, Computational and Constructive Design Theory. It contains research papers and surveys of recent research work on two closely related aspects of the study of combinatorial designs: design construction and computer-aided study of designs. Audience: This volume is suitable for researchers in the theory of combinatorial designs |
| Additional Information |
| BISAC Categories: - Mathematics | Linear & Nonlinear Programming - Mathematics | Combinatorics - Mathematics | Discrete Mathematics |
| Dewey: 511.6 |
| LCCN: 2003061144 |
| Series: Mathematics and Its Applications |
| Physical Information: 1.13" H x 6.28" W x 9.72" (1.71 lbs) 368 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This 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. |