Handbook of Combinatorial Designs


This page contains acknowledgments by individual authors and the editors for assistance with the CRC Handbook of Combinatorial Designs, edited by C.J. Colbourn and J.H. Dinitz, CRC Press, Boca Raton FL, 1996.

CRC Handbook of Combinatorial Designs, General Acknowledgments

from the editors-in-chief

Acknowledgments are due to many individuals. We must begin by acknowledging the excellent work done by the contributors. Their job was made difficult by the style and length restrictions placed upon them. Many had written hundreds of pages on their topic, yet were asked to summarize in a few pages. They also were asked to do this within the fairly rigid stylistic framework that is consistent now throughout the book. The editors were merciless in their attempt to uphold this style. Many chapters were edited extensively. We thank the authors for their cooperation.

Most chapters have profited from comments from a wide variety of readers, in addition to the authors and editors. Acknowledgments for assistance on individual chapters are lengthy, and are available on this page.

A compilation of this size can only be accomplished with the help of a small army of people. We were fortunate to have a helpful group of advisory editors, and excellent technical support from CRC Press, and the Universities of Vermont and Waterloo. We give special thanks to Debbie Street for her help in the area of statistical designs and to Vladimir Tonchev for expert advice on coding theory. Special thanks also go to Dan Archdeacon and to Norm Finizio who proofread much of the manuscript. In addition, for their support in compiling this handbook, we thank Julian Abel, Frank Bennett, Dave Dummit, Nora Konopka, Alan Ling, Ron Mullin, Bob Stern, Doug Stinson, Brett Tangedal, John van Rees, Wayne Yuhasz, and of course Hal and Daisy.

We thank our wives, Sue Dinitz and Karen Colbourn, and our children, Mike, Amy, and Tommy Dinitz and Susie Colbourn, for their support and love despite the many long hours that it took to assemble this handbook. At times we tried their patience, but they understood.

Part I: Balanced Incomplete Block Designs and t-Designs

  1. 2-(v, k, \lambda ) Designs of Small Order ( Rudolf Mathon), Alexander Rosa):
  2. BIBDs with Small Block Size (R. Julian R. Abel, Malcolm Greig):
  3. t-Designs, t \geq 3 ( Donald L. Kreher):
  4. Steiner Systems ( Charles J. Colbourn , Rudolf Mathon): Thanks to Ian Blake, Andries Brouwer, and Alex Rosa for references and helpful comments.
  5. Symmetric Designs (Tran van Trung):
  6. Resolvable and Near Resolvable Designs (R. Julian R. Abel, Steven C. Furino):

Part II: Latin Squares, MOLS, and Orthogonal Arrays

  1. Latin Squares ( Charles J. Colbourn , Jeffrey H. Dinitz ): Thanks to Frank Bennett, Donald Keedwell, Donald Preece, Peter Rodney, John van Rees, and Zhu Lie for their assistance.
  2. Mutually Orthogonal Latin Squares (MOLS) (R. Julian R. Abel, Andries E. Brouwer, Charles J. Colbourn , Jeffrey H. Dinitz ): The computation of a new table of bounds for MOLS, and for incomplete MOLS, was assisted by a large number of people in addition to the four authors. Foremost among these were Frank Bennett, Ron Mullin, Yin Jianxing, Hantao Zhang, and Zhu Lie. Valuable assistance was also provided by Jo Ellis-Monaghan, Anthony Evans, Malcolm Greig, Esther Lamken, Alan Ling, Gary Mullen, Peter Owens, Donald Preece, Paul Schellenberg, Doug Stinson, Rick Wilson, Miecyzslaw Wojtas, and Xiaojun Zhu.
  3. Incomplete MOLS (R. Julian R. Abel, Charles J. Colbourn , Jeffrey H. Dinitz ): See MOLS above.
  4. Orthogonal Arrays of Index More Than One ( Charles J. Colbourn ): Thanks to Jürgen Bierbrauer, Sam Hedayat, Dieter Jungnickel, Neil Sloane, Doug Stinson, and Yin Jianxing for pointing out references and for general comments.
  5. Orthogonal Arrays of Strength More Than Two (Jurgen Bierbrauer, Charles J. Colbourn ): Thanks especially to Dieter Jungnickel, Neil Sloane and Doug Stinson for pointing out relevant work.

Part III: Pairwise Balanced Designs

  1. PBDs and GDDs: The Basics (Ronald C. Mullin, Hans-Dietrich O.F. Gronau): The authors are indebted to many individuals for their assistance in the preparation of this chapter. In particular we thank Zhu Lie, Jianxing Yin, Charlie Colbourn, Alan Ling and Jeffrey Higham for their many contributions. Special thanks are due to Marg Feeney for her skilled preparation of the document. Their support was greatly appreciated.
  2. PBDs: Recursive Constructions (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):
  3. PBD-Closure (Frank E. Bennett, Hans-Dietrich O.F. Gronau, Alan C.H. Ling, Ronald C. Mullin): The authors would like to acknowledge the support of NATO-grant CRG 940085.
  4. Pairwise Balanced Designs as Linear Spaces (Hans-Dietrich O.F. Gronau, Ronald C. Mullin, Christian Pietsch):
  5. PBDs and GDDs of Higher Index (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):
  6. PBDs, Frames, and Resolvability (Ronald C. Mullin, Hans-Dietrich O.F. Gronau):

Part IV: Other Combinatorial Designs

  1. Association Schemes (Christopher D. Godsil):
  2. Balanced (Part) Ternary Designs (Thomas Kunkle, Dinesh G. Sarvate):
  3. Balanced Tournament Designs (Esther R. Lamken):
  4. Bhaskar Rao Designs (Warwick de Launey):
  5. Complete Mappings and Sequencings of Finite Groups (Donald Keedwell):
  6. Configurations (Harald Gropp):
  7. Costas Arrays (Herbert Taylor):
  8. Coverings ( Douglas R. Stinson):
  9. Cycle Systems (C.A. Rodger):
  10. Difference Families (R. Julian R. Abel):
  11. Difference Matrices ( Charles J. Colbourn , Warwick de Launey): Thanks to Julian Abel, Dieter Jungnickel, Don Kreher, Bill Palmer, Jennie Seberry, and Neil Sloane for their assistance.
  12. Difference Sets: Abelian (Dieter Jungnickel, Alexander Pott):
  13. Difference Sets: Nonabelian (Ken W. Smith): The author thanks Robert A. Liebler (Colorado State University) who has made numerous contributions in the area of nonabelian difference sets which, due to space, are not explicitly recognized in the chapter.
  14. Difference Triangle Sets ( Charles J. Colbourn ): Nabil Shalaby brought the importance of this area to my attention, and provided a number of useful references. Thanks also to Yeow Meng Cheeand Alex Rosa for providing additional materials.
  15. Directed Designs (Frank E. Bennett, Alireza Mahmoodi):
  16. D-Optimal Matrices (Hadi Kharaghani):
  17. Embedding Partial Quasigroups (C.C. Lindner):
  18. Equidistant Permutation Arrays (Alireza Mahmoodi, Paul J. Schellenberg):
  19. Factorial Designs ( Deborah J. Street):
  20. Frequency Squares (Charles F. Laywine): The author would like to thank Gary L. Mullen for his help on this section.
  21. Generalized Quadrangles (Stanley E. Payne):
  22. Graph Decompositions and Designs (Katherine Heinrich): Many thanks to Jiping Liu and Joseph Yu for their invaluable assistance in preparing this section.
  23. Graphical Designs (Yeow Meng Chee):
  24. Hadamard Matrices and Designs (R. Craigen):
  25. Hall Triple Systems (Lucien Beneteau):
  26. Howell Designs ( Jeffrey H. Dinitz):
  27. Maximal Sets of MOLS (Anthony B. Evans):
  28. Mendelsohn Designs (Eric Mendelsohn): Thanks to Frank Bennet and Zhu Lie for corrections and updates.
  29. The Oberwolfach Problem ( Brian Alspach):
  30. Ordered Designs and Perpendicular Arrays (Jürgen Bierbrauer):
  31. Orthogonal Designs (Jennifer Seberry, R. Craigen):
  32. Orthogonal Main Effect Plans ( Deborah J. Street):
  33. Packings ( Douglas R. Stinson):
  34. Partial Geometries (Joseph A. Thas):
  35. Partially Balanced Incomplete Block Designs ( Deborah J. Street, Anne Penfold Street ):
  36. Quasigroups (Frank E. Bennett):
  37. Quasi-Symmetric Designs (Mohan S. Shrikhande): The author acknowledges support of Central Michigan University FRCE grant #42943.
  38. (r, \lambda )-designs (G.H. John van Rees): The author would like to thank Ron Mullin and Ralph Stanton.
  39. Room Squares ( Jeffrey H. Dinitz ): Thanks to Charlie Colbourn for helping on this section; the first section written for this handbook.
  40. Self-Orthogonal Latin Squares (SOLS) (L. Zhu):
  41. SOLS with a Symmetric Orthogonal Mate (SOLSSOM) (Norman J. Finizio):
  42. Sequences with Zero Autocorrelation (Christos Koukouvinos):
  43. Skolem Sequences (Nabil Shalaby):
  44. Spherical t-Designs (Stuart G. Hoggar):
  45. Starters ( Jeffrey H. Dinitz ):
  46. Trades and Defining Sets (Anne Penfold Street ):
  47. (t,m,s)-Nets ( Charles J. Colbourn ): Mark Lawrence kindly provided much material in this area. In addition, Gary Mullen gave numerous helpful comments.
  48. Tuscan Squares (Hong-Yeop Song, Jeffrey H. Dinitz ): The second author would like to thank Herb Taylor for introducing him to the first author.
  49. t-Wise Balanced Designs (Earl S. Kramer):
  50. Uniformly Resolvable Designs (Peter Danziger, Peter Rodney):
  51. Vector Space Designs (Dijen K. Ray-Chaudhuri):
  52. Weighing Matrices and Conference Matrices (R. Craigen):
  53. Whist Tournaments (Ian Anderson):
  54. Youden Designs, Generalized ( Charles J. Colbourn ): Thanks to Sam Hedayat for providing literature on this topic.
  55. Youden Squares (Donald A. Preece):

Part V: Applications

  1. Codes (Vladimir D. Tonchev):
  2. Computer Science: Selected Applications ( Charles J. Colbourn ): Thanks especially to Paul van Oorschot, with whom a lengthier survey on this subject was published in 1989. Thanks also to Yeow Meng Chee, Jeff Dinitz, K. Gopalakrishnan, and Doug Stinson for helpful comments.
  3. Applications of Designs to Cryptography (K. Gopalakrishnan, Douglas R. Stinson):
  4. Derandomization (K. Gopalakrishnan, Douglas R. Stinson):
  5. Optimality and Efficiency: Comparing Block Designs ( Deborah J. Street):
  6. Group Testing ( Charles J. Colbourn ): Thanks to Prof. Raghavarao for kindly providing related literature. Thanks also to Yeow Meng Chee for helpful comments.
  7. Scheduling a Tournament ( Jeffrey H. Dinitz , Esther R. Lamken, Walter D. Wallis ):
  8. Winning the Lottery ( Charles J. Colbourn ): A great many people educated me about this subject. Having never bought a lottery ticket in my life, their nuances were a mystery to me. Thanks to Dom de Caen, Jeff Dinitz, Michael Morley, Patric Ostergard, Tim Tillson, and John van Rees for their assistance.

Part VI: Related Mathematics and Computational Methods

  1. Finite Groups and Designs (Leo G. Chouinard II, Robert Jajcay, Spyros S. Magliveras):
  2. Number Theory and Finite Fields (Hugh Williams): [The editors would like to thank Dave Dummit and Brett Tangedal for their assistance with this section.]
  3. Graphs and Multigraphs (Gordon F. Royle): The author wishes to thank Brendan McKay and Gunnar Brinkmann for their help in compiling this section. [The editors would like to thank Dan Archdeacon for his useful comments here also.]
  4. Factorizations of Graphs (Lars D. Andersen):
  5. Strongly Regular Graphs (Andries E. Brouwer):
  6. Two-Graphs (Edward Spence): In his writing of this section the author was greatly influenced by the papers of J. J. Seidel cited in the references. These have been of not inconsiderable importance in the development of the theory of two-graphs. He also gratefully acknowledges the assistance given by F. C. Bussemaker and R.A. Mathon in compiling much of the data on two-graphs that appears on the home page.
  7. Classical Geometries (Albrecht Beutelspacher):
  8. Projective Planes, Nondesarguesian (Marialuisa J. de Resmini):
  9. Computational Methods in Design Theory (Peter B. Gibbons): The author wishes to thank the following for their encouraging comments and many helpful suggestions concerning various drafts of this section: Leo Chouinard, Charlie Colbourn , Jeff Dinitz , David Garnick, Curt Hjorring, Don Kreher, Clement Lam, Spyros S. Magliveras, Rudolf Mathon, Brendan McKay, Patric Ostergard, Christian Pietsch, Doug Stinson.

Return to the HCD home page.