Combinatorics of Symmetric Designs

Inbunden, Engelska, 2006

Del 5 i serien New Mathematical Monographs

1 942 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

The 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.

Produktinformation

Utgivningsdatum:2006-05-25
Mått:159 x 235 x 30 mm
Vikt:982 g
Format:Inbunden
Språk:Engelska
Serie:New Mathematical Monographs
Antal sidor:534
Förlag:Cambridge University Press
ISBN:9780521818339

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik

Mer om författaren

Yury J. Ionin is a Professor of Mathematics at Central Michigan University, USA. Mohan S. Shrikhande is a Professor of Mathematics at Central.

Recensioner i media

'Most results in these chapters have never appeared in book form. Researchers in all areas of combinational 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 advance course in combinatorial designs.' L'enseignement mathematique

Innehållsförteckning

1. Combinatorics of finite sets; 2. Introduction to designs; 3. Vector spaces over finite fields; 4. Hadamard matrices; 5. Resolvable designs; 6. Symmetric designs and t-designs; 7. Symmetric designs and regular graphs; 8. Block intersection structure of designs; 9. Difference sets; 10. Balanced generalized weighing matrices; 11. Decomposable symmetric designs; 12. Subdesigns of symmetric designs; 13. Non-embeddable quasi-residual designs; 14. Ryser designs; Appendix; Bibliography; Index.