Combinatorial Designs: Constructions and AnalysisSpringer Science & Business Media, 08.05.2007 - 300 Seiten Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatiorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applied math, combinatorics, and applied statistics will find the book an essential resource. |
Inhalt
1 | |
Symmetric BIBDs | 23 |
Difference Sets and Automorphisms | 41 |
Hadamard Matrices and Designs 73 | 72 |
Resolvable BIBDs | 101 |
Latin Squares | 123 |
Pairwise Balanced Designs I 157 | 156 |
Pairwise Balanced Designs II | 179 |
tDesigns and twise Balanced Designs | 201 |
Orthogonal Arrays and Codes 225 | 224 |
Applications of Combinatorial Designs | 257 |
A Small Symmetric BIBDs and Abelian Difference Sets | 278 |
287 | |
295 | |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
1)-difference set A)-BIBD Abelian group affine plane affine resolvable algorithm apply Lemma authentication code automorphism block contains Bruck-Ryser-Chowla Theorem codewords coefficients column combinatorial design compute conference matrix construct Corollary define Definition delete denote design theory difference set entry equation Example finite field following properties following result group G group-divisible design Hadamard matrix Hence idempotent incidence matrix Inequality integer isomorphic matrix of order modulo MOLS MOLS(n multiset nonzero number of blocks obtain occurs in exactly orbits ordered pair orthogonal array orthogonal Latin squares pair of points pairwise balanced design parallel classes parameters permutation plane of order points occurs polynomial positive integer prime power projective plane proof of Theorem prove q)-code QR(q quadratic residue quasigroup Reed-Muller codes regular Hadamard matrix resolvable BIBD SK(k squares of order strong starter subset subspace Suppose symmetric BIBD t-designs TD(k unique block vectors Zp[x