Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-20T16:38:08.263Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Restricted Class of Block Design Games

Published online by Cambridge University Press:  20 November 2018

Jane W. Di Paola
Jane W. Di Paola*
Affiliation:
The City University of New York
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Block design games have been developed by Richardson (12) and by Hoffman and Richardson (8), who proved a number of theorems concerning such games by studying the number of elements in a blocking coalition. Hoffman and Richardson listed as unsolved (except for PG(2, 3)) the following problem: What is the minimum number of elements in a blocking coalition of a block design game?

This note considers blocking coalitions in those games that are dual to block designs having λ = 1 and r — k > 0. For such games certain blocking coalitions are shown to be related to sets of mutually disjoint blocks in the design to which the game is dual. In particular, for Steiner triple systems the largest odd-numbered set of mutually disjoint triples is shown to yield a minimum blocking coalition in the dual.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 18 , 1966 , pp. 225 - 236
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Bose, R. C., On the construction of balanced incomplete block designs, Ann. Eugen., 9 (1939), 353–399.Google Scholar
2. Cole, F. N., White, A. S., and Cummings, Louise D., Complete classification of triad systems on fifteen elements, Mem. Nat. Acad. Sci., XIV, No. 2 (1925).Google Scholar
3. Connor, W. S. Jr., On the structure of balanced incomplete block designs, Ann. Math. Statist., 23 (1952), 57–71.Google Scholar
4. Hall, M. Jr., A survey of combinatorial analysis, in Kaplansky, I., Hewitt, E., Hall, M. Jr., and Fortet, R., Some aspects of analysis and probability (New York, 1958).Google Scholar
5. Hall, M. Jr., Automorphisms of Steiner triple systems, IBM J. Res. Develop., 4 (1960), 460–472.Google Scholar
6. Hall, M. Jr., and Swift, J. D., Determination of Steiner triple systems of order 15, Math. Tables and other Aids Comput., 9 (1955), 146–152.Google Scholar
7. Hanani, H., The existence and construction of balanced incomplete block designs, Ann. Math. Statist., 32 (1961), 361–368.Google Scholar
8. Hoffman, A. J. and Richardson, M., Block design games, Can. j. Math., 13 (1961), 110–128.Google Scholar
9. Mann, H. B., Analysis and design of experiments (New York, 1949).Google Scholar
10. Moore, E. H., Concerning triple systems, Math. Ann., 43 (1893), 271–285.Google Scholar
11. Reiss, M., Ueber eine Steinersche combinatorische Aufgabe, welche im 45sten Bande dieses Journals, Seite 181, gestellt worden ist, J. Reine Angew. Math., 56 (1859), 326–344.Google Scholar
12. Richardson, M., On finite projective games, Proc. Amer. Math. Soc., 7 (1956), 458–465.Google Scholar
13. RYSER, H. J., Combinatorial mathematics, Carus Math., Mono. no. 14 (New York, 1963).Google Scholar
14. Singer, J., A theorem in finite projective geometry and some application to number theory, Trans. Amer. Soc, 43 (1938), 377–385.Google Scholar
15. Veblen, O. and Young, J. W., Projective geometry, vol. I (Boston, 1910).Google Scholar