9781402075995 - Designs 2002: Further Computational and Constructive Design Theory (Mathematics and Its Applications, 563, Band 563) (5 Ergebnisse)

Zustand: New. In.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New.

Zustand: New. A sequel to the 1996 compilation, "Computational and Constructive Design Theory". It contains research papers and surveys of research work on two related aspects of the study of combinatorial designs: design construction and computer-aided study of designs. It is suitable for researchers in the theory of combinatorial designs. Editor(s): Wallis, Walter D. (Southern Illinois University). Series: Mathematics and its Applications. Num Pages: 368 pages, biography. BIC Classification: UGC. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 22. Weight in Grams: 724. . 2003. 2nd ed. 2003. Hardback. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.