Defining Sets for Block Designs: An Update

  • Anne Penfold Street
Part of the Mathematics and Its Applications book series (MAIA, volume 329)

Abstract

This paper deals with the following question: how many, and which, blocks of a design with given parameters must be known before the remaining blocks of the design are uniquely determined? We survey the theoretical background on such defining sets, some specific results for smallest and other minimal defining sets for small designs and the techniques used in finding them, the few known results on minimal defining sets for infinite classes of designs, and the conjectures on minimal defining sets for some classes of Hadamard designs.

Keywords

Dhas Brendan 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Peter J Cameron, How few entries determine any Latin square? Bulletin of the Institute of Combinatorics and its Applications 10 (1994), 63–65.MathSciNetMATHGoogle Scholar
  2. [2]
    John Cannon, A language for group theory, Department of Pure Mathematics, University of Sydney, Sydney, Australia (1987).Google Scholar
  3. [3]
    R T Curtis, Eight octads suffice, Journal of Combinatorial Theory, Series A 36 (1984), 116–123.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    Cathy Delaney, private communication, (1994).Google Scholar
  5. [5]
    Rebecca A H Gower, Minimal defining sets in a family of Steiner triple systems, Australasian Journal of Combinatorics 8 (1993), 55–73.MathSciNetMATHGoogle Scholar
  6. [6]
    Rebecca A H Gower, Minimal defining sets for another infinite family of Steiner triple systems, submitted for publication.Google Scholar
  7. [7]
    Ken Gray, On the minimum number of blocks defining a design, Bulletin of the Australian Mathematical Society 41 (1990), 97–112.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    Ken Gray, Further results on smallest defining sets of well known designs, Australasian Journal of Combinatorics 1 (1990), 91–100.MathSciNetMATHGoogle Scholar
  9. [9]
    Ken Gray, Defining sets of single-transposition-free designs, Utilitas Math- ematica 38 (1990), 97–103.MathSciNetMATHGoogle Scholar
  10. [10]
    Ken Gray and Anne Penfold Street, Smallest defining sets of the five non- isomorphic 2—(15,7,3) designs, Bulletin of the Institute of Combinatorics and its Applications 9 (1993), 96–102.MathSciNetMATHGoogle Scholar
  11. [11]
    Ken Gray and Anne Penfold Street, The smallest defining set of the 2- (15,7,3) designs associated with PG(3,2): a theoretical approach, Bulletin of the Institute of Combinatorics and its Applications 11 (1994), 77–83.MathSciNetMATHGoogle Scholar
  12. [12]
    Catherine S Greenhill, An algorithm for finding smallest defining sets of t-designs, Journal of Combinatorial Mathematics and Combinatorial Computing 14 (1993), 39–60.MathSciNetMATHGoogle Scholar
  13. [13]
    Catherine S Greenhill and Anne Penfold Street, Smallest defining sets of some small t-designs and relations to the Petersen graph, Utilitas Mathematica, to appear.Google Scholar
  14. [14]
    A Khodkar, Smallest defining sets for the 36 non-isomorphic twofold triple systems of order nine, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear.Google Scholar
  15. [15]
    Thomas Kunkle and Jennifer Seberry, A few more small defining sets for SBIBD(4t–1,2t– 1,t - 1), submitted for publication.Google Scholar
  16. [16]
    Brendan D McKay, nauty User’s Guide (Version 1.5), Australian National University Computer Science Technical Report TR-CS-90–02.Google Scholar
  17. [17]
    Tony Moran, Smallest defining sets of 2—(9,4,3) and 3—(10,5,3) designs, Australasian Journal of Combinatorics 10 (1994), 265–288.MathSciNetMATHGoogle Scholar
  18. [18]
    Tony Moran, Defining sets of the 2-(19,9,4) designs and a class of Hadamard designs,submitted for publication.Google Scholar
  19. [19]
    Tony Moran, private communication, (1993).Google Scholar
  20. [20]
    Dinesh Sarvate and. Jennifer Seberry, A note on small defining sets for some SBIBD(4t—1, 2t—1, t—1), Bulletin of the Institute of Combinatorics and its Applications 10 (1994), 26–32.MathSciNetMATHGoogle Scholar
  21. [21]
    Jennifer Seberry, On small defining sets for some SBIBD(4t — 1,21 — 1,2 — 1), Bulletin of the Institute of Combinatorics and its Applications 4 (1992), 58–62; corrigendum, 6 (1992), 62.Google Scholar
  22. [22]
    Martin J Sharry and Sylvia H Elmes, The program COMPLETE, private communication, (1992).Google Scholar
  23. [23]
    Anne Penfold Street, Defining sets for t-designs and critical sets for Latin squares, New Zealand Journal of Mathematics 21 (1992), 133–144.MathSciNetMATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers. Printed in the Netherlands 1995

Authors and Affiliations

  • Anne Penfold Street
    • 1
  1. 1.Centre for Combinatorics, Department of MathematicsThe University of QueenslandBrisbaneAustralia

Personalised recommendations