Combinatorial design theory /
Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science. This volume is a collection of forty-one state-of-the-art research art...
Saved in:
Corporate Authors: | |
---|---|
Group Author: | ; ; |
Published: |
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
|
Publisher Address: | Amsterdam ; New York : New York, N.Y., U.S.A. : |
Publication Dates: | 1987. |
Literature type: | eBook |
Language: | English |
Series: |
North-Holland mathematics studies ;
149 Annals of discrete mathematics ; 34 |
Subjects: | |
Online Access: |
http://www.sciencedirect.com/science/bookseries/03040208/149 |
Summary: |
Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science. This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory. The articles develop new methods for the construction and analysis of designs and related combinatorial configurations; both new theoretical methods, and new computational tools and results, are presented. In particular, they extend the current st |
Item Description: | Festschrift for Alex Rosa. |
Carrier Form: | 1 online resource (xii, 470 pages). |
Bibliography: | Includes bibliographical references. |
ISBN: |
9780444703286 0444703284 9780080872605 0080872603 |
Index Number: | QA166 |
CLC: | O157.2 |
Contents: | Front Cover; Combinatorial Design Theory; Copyright Page; Preface; Acknowledgements; Contents; Chapter 1. The Existence of Symmetric Latin Squares with One Prescribed Symbol in Each Row and Column; Chapter 2. A Fast Method for Sequencing Low Order Non-Abelian Groups; Chapter 3. Pairwise Balanced Designs with Prime Power Block Sizes Exceeding 7; Chapter 4. Conjugate Orthogonal Latin Squares with Equal-Sized Holes; Chapter 5. On Regular Packings and Coverings; Chapter 6. An Inequality on the Parameters of Distance Regular Graphs and the Uniqueness of a Graph Related to M23. |