Combinatorial Designs (eBook)

A Tribute to Haim Hanani

A. Hartman (Herausgeber)

eBook Download: PDF

1989 | 1. Auflage
385 Seiten
Elsevier Science (Verlag)
978-0-08-086782-3 (ISBN)

Infos

Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.

The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani's own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.

Inhalt

Front Cover 1
Combinatorial Designs—A Tribute To Haim Hanani 4
Copyright Page 5
Contents 6
Combinatorial designs - A tribute to Haim Hanani 10
Chapter 1. Resolvable group divisible designs with block size 3 14
Chapter 2. Minimally projectively embeddable Steiner systems 30
Chapter 3. The spectra of a variety of quasigroups and related combinatorial designs 38
Chapter 4. New cyclic (61, 244, 40, 10, 6) BIBDs (Note) 60
Chapter 5. A unital in the Hughes plane of order nine (Note) 64
Chapter 6. Percentages in pairwise balanced designs 66
Chapter 7. On complete arcs in Steiner systems S(2, 3v) and S(2, 4v) 74
Chapter 8. A survey of recent works with respect to a characterization of an (n, k, d q)-code meeting the Griesmer bound using a min-hyper in a finite projective geometry
Chapter 9. BIBD's with block-size seven 98
Chapter 10. On Alspach's conjecture 106
Chapter 11. Some self-blocking block designs 132
Chapter 12. The Steiner systems S (2, 4, 25) with nontrivial automorphism group 146
Chapter 13. Balanced tournament designs and related topics 168
Chapter 14. Automorphisms of 2-(22, 8, 4) designs 186
Chapter 15. Nesting of cycle systems of odd length 200
Chapter 16. On the (15, 5, .)-family of BIBDs 214
Chapter 17. Finite bases for some PBD-closed sets 226
Chapter 18. On the constructive enumeration of packings and coverings of index one 246
Chapter 19. The existence of simple S3(3, 4, v) 264
Chapter 20. On combinatorial designs with subdesigns 268
Chapter 21. Cyclical Steiner Triple Systems orthogonal to their opposites 290
Chapter 22. Symmetric quasigroups of odd order 294
Chapter 23. Partitioning sets of quadruples into designs I 308
Chapter 24. Infinite families of strictly cyclic Steiner quadruple systems 316
Chapter 25. Minimal pairwise balanced designs 326
Chapter 26. Combinatorial problems in repeated measurements designs 332
Chapter 27. Locally trivial t-designs and t-designs without repeated blocks 354
Chapter 28. A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs 366
Chapter 29. Modifications of the "central-method" to construct Steiner triple systems 376
Author Index to Volume 77 394

Produkt-Details

• Erscheint lt. Verlag: 11.10.1989
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Themenwelt: Technik
• ISBN-10: 0-08-086782-0 / 0080867820
• ISBN-13: 978-0-08-086782-3 / 9780080867823