Abstract
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of blocks into other 1-designs. We discover an infinite family of 1-designs with at most two block intersection numbers that each have a unique unrefinable decomposition, and we give a polynomial-time algorithm to compute an unrefinable decomposition for each such design from the family. Combinatorial designs from this family include: finite projective planes of order n; SOMAs, and more generally, partial linear spaces of order (s, t) on (s + 1)2 points; as well as affine designs, and more generally, strongly resolvable designs with no repeated blocks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arhin J. Further SOMA Update, http://www.maths.qmul.ac.uk/~arhin/soma/somas.html
Arhin J (2006) On the construction of SOMAs and related partial linear spaces. Ph.D. thesis, University of London
Cameron PJ. British Combinatorial Conference Problem List, http://www.maths.qmul.ac.uk/~pjc/bcc/ allprobs.pdf
Colbourn CJ and Rosa A (1999). Triple systems. Oxford Sci. Pub., Oxford
Ionin YJ and Shrikhande MS (1998). Resolvable pairwise balanced designs. J Stat Plan Infer
Ionin YJ and Shrikhande MS (2006). Combinatorics of symmetric designs. Cambridge University Press, New mathematical monographs
Phillips NCK and Wallis WD (1996). All solutions to a tournament problem. Congressus Numerantium 114: 193–196
Research Problems section, Problem 197(1994) Discrete Mathematics 125:407–417
Shrikhande MS and Sane SS (1991). Quasi-Symmetric Designs. Cambridge University Press, London mathematical society lecture notes series
Shrikhande SS, Raghavaro D (1964) Affine α-resolvable incomplete block designs. Contributions to Statistics Pergamon Press, Oxford, pp 471–480
Soicher LH (1999). On the structure and classification of SOMAs: generalizations of mutually orthogonal Latin squares. Electron J Combin 6(R32): 15
Soicher LH. SOMA Update, http://www.maths.qmul.ac.uk/~leonard/soma/
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J.D. Key.
Rights and permissions
About this article
Cite this article
Arhin, J. On the structure of 1-designs with at most two block intersection numbers. Des Codes Crypt 43, 103–114 (2007). https://doi.org/10.1007/s10623-007-9067-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9067-4