Hostname: page-component-7bb8b95d7b-qxsvm Total loading time: 0 Render date: 2024-09-29T22:30:12.002Z Has data issue: false hasContentIssue false

Irreducible designs from supplementary difference sets

Published online by Cambridge University Press:  17 April 2009

D.R. Breach
Affiliation:
Department of Mathematics, University of Canterbury, Christchurch, New Zealand
Anne Penfold Street
Affiliation:
Department of Mathematics, University of Queensland, St Lucia, Queensland 4067, Australia.
Rights & Permissions [Opens in a new window]

Abstract

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.

A family of n k-subsets of the integers modulo ν are said to be supplementary difference sets if developing them by addition modulo ν leads to a balanced incomplete block design, and to be minimal if no proper subfamily leads to a balanced incomplete block design when developed modulo ν. In other words, the family of supplementary difference sets is minimal precisely when it leads to a balanced incomplete block design which cannot be partitioned into a union of proper subdesigns, each consisting of complete cyclic sets of ν blocks. We discuss the conditions under which such a balanced incomplete block design can be partitioned in some non-cyclic fashion into a union of proper subdesigns.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1985

References

[1]Breach, D.R. and Thompson, A.R., “Reducible 2–(11, 5, 14) and 3–(12, 6, 14) designs”, J. Austral. Math. Soc. Ser. A (to appear).Google Scholar
[2]Morgan, Elizabeth J., “Some small quasi-multiple designs”, Ars Combin. 3 (1977), 233250.Google Scholar
[3]Penfold Street, Anne, “On quasi-multiple designs”, Combinatorial Mathematics V, 206208 (Lecture Notes in Mathematics, 622. Springer-Verlag, Berlin, Heidelberg, New York, 1977).CrossRefGoogle Scholar