## Combinatorics of Symmetric DesignsThe aim of this book is to provide a unified exposition of the theory of symmetric designs with emphasis on recent developments. The authors cover the combinatorial aspects of the theory giving particular attention to the construction of symmetric designs and related objects. The last five chapters of the book are devoted to balanced generalized weighing matrices, decomposable symmetric designs, subdesigns of symmetric designs, non-embeddable quasi-residual designs, and Ryser designs. Most results in these chapters have never previously appeared in book form. The book concludes with a comprehensive bibliography of over 400 entries. Researchers in all areas of combinatorial designs, including coding theory and finite geometries, will find much of interest here. Detailed proofs and a large number of exercises make this book suitable as a text for an advanced course in combinatorial designs. |

### What people are saying - Write a review

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

### Contents

Section 18 | 299 |

Section 19 | 302 |

Section 20 | 321 |

Section 21 | 323 |

Section 22 | 327 |

Section 23 | 351 |

Section 24 | 354 |

Section 25 | 365 |

Section 9 | 147 |

Section 10 | 154 |

Section 11 | 186 |

Section 12 | 212 |

Section 13 | 213 |

Section 14 | 247 |

Section 15 | 259 |

Section 16 | 280 |

Section 17 | 289 |

Section 26 | 368 |

Section 27 | 387 |

Section 28 | 388 |

Section 29 | 407 |

Section 30 | 429 |

Section 31 | 443 |

Section 32 | 447 |

Section 33 | 462 |

### Other editions - View all

### Common terms and phrases

2-design 2-subsets abelian group adjacency matrix afﬁne plane block matrix cardinality columns complement conference matrix constructed Corollary cyclic group deﬁned Deﬁnition denote design of index design with parameters difference sets disjoint distinct blocks eigenvalues element entries equal equation exactly exists a symmetric ﬁeld ﬁnite ﬁrst GF(q group G group of order group of symmetries group ring Hadamard 3-design implies incidence matrix incidence structure intersection numbers isomorphic Kronecker product Latin square Lemma Let G Let H Let q matrix of order non-embeddable nonzero number of blocks obtain order q parallel classes partition permutation plane of order point set polynomial positive integer prime power projective plane Proof Proposition Prove quasi-symmetric regular Hadamard matrix replication number resolution class Ryser design S. S. Shrikhande Shrikhande strongly regular graphs subdesign subset subspaces Suppose symmetric design Theorem vector space vertices X)-design yields