Combinatorial Designs
eBook - PDF

Combinatorial Designs

A Tribute to Haim Hanani

  1. 385 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Combinatorial Designs

A Tribute to Haim Hanani

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Combinatorial Designs by A. Hartman in PDF and/or ePUB format, as well as other popular books in Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.

Information

Publisher
North Holland
Year
1989
Print ISBN
9780444881151
eBook ISBN
9780080867823
Topic
Mathematics
Subtopic
Discrete Mathematics
Index
Mathematics

Table of contents

  1. Front Cover
  2. Combinatorial Designs—A Tribute To Haim Hanani
  3. Copyright Page
  4. Contents
  5. Combinatorial designs - A tribute to Haim Hanani
  6. Chapter 1. Resolvable group divisible designs with block size 3
  7. Chapter 2. Minimally projectively embeddable Steiner systems
  8. Chapter 3. The spectra of a variety of quasigroups and related combinatorial designs
  9. Chapter 4. New cyclic (61, 244, 40, 10, 6) BIBDs (Note)
  10. Chapter 5. A unital in the Hughes plane of order nine (Note)
  11. Chapter 6. Percentages in pairwise balanced designs
  12. Chapter 7. On complete arcs in Steiner systems S(2, 3v) and S(2, 4v)
  13. 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
  14. Chapter 9. BIBD's with block-size seven
  15. Chapter 10. On Alspach's conjecture
  16. Chapter 11. Some self-blocking block designs
  17. Chapter 12. The Steiner systems S (2, 4, 25) with nontrivial automorphism group
  18. Chapter 13. Balanced tournament designs and related topics
  19. Chapter 14. Automorphisms of 2-(22, 8, 4) designs
  20. Chapter 15. Nesting of cycle systems of odd length
  21. Chapter 16. On the (15, 5, λ)-family of BIBDs
  22. Chapter 17. Finite bases for some PBD-closed sets
  23. Chapter 18. On the constructive enumeration of packings and coverings of index one
  24. Chapter 19. The existence of simple S3(3, 4, v)
  25. Chapter 20. On combinatorial designs with subdesigns
  26. Chapter 21. Cyclical Steiner Triple Systems orthogonal to their opposites
  27. Chapter 22. Symmetric quasigroups of odd order
  28. Chapter 23. Partitioning sets of quadruples into designs I
  29. Chapter 24. Infinite families of strictly cyclic Steiner quadruple systems
  30. Chapter 25. Minimal pairwise balanced designs
  31. Chapter 26. Combinatorial problems in repeated measurements designs
  32. Chapter 27. Locally trivial t-designs and t-designs without repeated blocks
  33. Chapter 28. A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs
  34. Chapter 29. Modifications of the "central-method" to construct Steiner triple systems
  35. Author Index to Volume 77