Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Designs 2002: Further Computational and Constructive Design Theory /
.
Bookmark this Record
Catalogue Record 41976
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 41976
.
Reviews
Catalogue Record 41976
.
British Library
Resolver for RSN-41976
Google Scholar
Resolver for RSN-41976
WorldCat
Resolver for RSN-41976
Catalogo Nazionale SBN
Resolver for RSN-41976
GoogleBooks
Resolver for RSN-41976
ICTP Library
Resolver for RSN-41976
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.6
Title
Designs 2002 ([EBook] :) : Further Computational and Constructive Design Theory / / edited by W. D. Wallis.
Added Personal Name
Wallis, W. D.
editor.
Other name(s)
SpringerLink (Online service)
Publication
Boston, MA : : Springer US : : Imprint: Springer, , 2003.
Physical Details
XII, 368 p. : online resource.
Series
Mathematics and its applications
; 563
ISBN
9781461302452
Summary Note
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.:
Contents note
1 The Existence of 2-SOLSSOMs -- 1 Introduction -- 2 Direct Constructions -- 3 Recursive Constructions -- 2 Conjugate Orthogonal Diagonal Latin Squares with Missing Subsquares -- 1 Introduction -- 2 Preliminaries -- 3 Direct Construction -- 4 Recursive Construction -- 5 A General Bound -- 6 The Case 2 ? n ? 6 -- 3 Combinatorial Trades: a Survey of Recent Results -- 1 Introduction and Preliminaries -- 2 Trades in designs -- 3 Trades in latin squares -- 4 Trade uses -- 5 Latin representations and trades used in tripartite decompositions -- 6 ?-way trades -- 7 Graphical trades -- 8 Future directions -- 4 Two-stage Generalized Simulated Annealing for the Construction of Change-Over Designs -- 1 Introduction -- 2 Notation and Definitions -- 3 A Two Stage Generalized Simulated Annealing Algorithm -- 4 Performance of the Two-Stage GSA -- 5 New Lower Bounds on the Maximum Number of Mutually Orthogonal Steiner Triple Systems -- 1 Introduction -- 2 Starters over Finite Fields -- 3 Automorphisms and Hill-climbing -- 4 Conclusion -- 6 On minimal defining sets in AG(d, 3) -- 1 Background -- 2 Introduction -- 3 Further Preliminaries -- 4 Proof of the Main Theorem -- 5 Sets of good hyperplanes in AG(d, 3) -- 6 Related critical sets -- 7 Appendix -- 7 Hadamard Matrices, Orthogonal designs and Construction Algorithms -- 1 Algorithms for constructing Hadamard matrices -- 2 On inequivalent Hadamard matrices -- 3 Algorithms for constructing orthogonal designs -- 4 Short amicable sets and Kharaghani type orthogonal designs -- 8 Constructing a Class of Designs with Proportional Balance -- 1 Proportionally balanced designs -- 2 The method of construction -- 3 Feasible parameters for ? = 2, 3 and 4 -- 4 Constructions motivated by Construction 5 -- 9 Constructions Using Balanced n-ary Designs -- 1 Introduction -- 2 Balanced n-ary Designs -- 3 Our Construction -- 4 Some Examples -- 5 Some Non-existence Results -- 6 An Improved Construction -- 7 Quadratic Residues -- 8 Another Improvement -- 9 An Application -- 10 More Difference Families -- 10 Sets of Steiner Triple Systems of Order 9 Revisited -- 1 Introduction -- 2 Large sets -- 3 Results -- 4 Uniformly intersecting sets -- 11 Solving Isomorphism Problems for t-Designs -- 1 Introduction -- 2 Basics -- 3 Moebius Inversions -- 4 Extensions of designs -- 12 Finding Double Youden Rectangles -- 1 Introduction -- 2 Definitions and Literature -- 3 Examples -- 4 Searching for a 13-cyclic 13 ? 40 DYR -- 5 Isomorphism -- 6 Further Properties of our new DYRs -- 7 Check for Balance -- 13 Kirkman Triple Systems and their Generalizations: A Survey -- 1 Introduction -- 2 Constructions for Kirkman Triple Systems and Nearly Kirkman Triple Systems for all admissible orders -- 3 Early Generalizations -- 4 Resolvable Packings and Coverings of v points where v ? 0 (mod 3) -- 5 Other Generalizations -- 6 Conclusion and Acknowledgements.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4613-0245-2
Links to Related Works
Subject References:
Combinatorics
.
Computer Science
.
Computers
.
Discrete Mathematics in Computer Science
.
Mathematics
.
Theory of Computation
.
Authors:
Wallis, W. D.
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Mathematics and its applications
.
Classification:
511.6
.
.
ISBD Display
Catalogue Record 41976
.
Tag Display
Catalogue Record 41976
.
Related Works
Catalogue Record 41976
.
Marc XML
Catalogue Record 41976
.
Add Title to Basket
Catalogue Record 41976
.
Catalogue Information 41976
Beginning of record
.
Catalogue Information 41976
Top of page
.
Download Title
Catalogue Record 41976
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
41976
1
41976
-
2
41976
-
3
41976
-
4
41976
-
5
41976
-
Quick Search
Search for