Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-28T04:58:29.225Z Has data issue: false hasContentIssue false
  • English
  • Français

A combinatorial problem of T. G. Room

Published online by Cambridge University Press:  26 February 2010

J. W. Archbold
J. W. Archbold
Affiliation:
University College, London, W.C.I.
Get access

Extract

A Room square is an arrangement of the k(2k−1) unordered pairs (ar, as), with r≠s, formed from 2k symbols a0, a1 …, a2k−1 in a square of 2k−1 rows and columns such that in each row and column there appear k pairs (and k−1 blanks) which among them contain all 2k symbols.

Type
Research Article
Information
Mathematika , Volume 7 , Issue 1 , June 1960 , pp. 50 - 55
Copyright
Copyright © University College London 1960

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Room, T. G., “A new type of magic square”, Math. Gazette, 39 (1955), 307.CrossRefGoogle Scholar
2.Archbold, J. W. and Johnson, N. L., “A construction for Room's squares and an application in experimental design”, Annals of Mathematical Statistics, 29 (1958), 219–225.CrossRefGoogle Scholar
3.Chowla, S. and Ryser, H. J., “Combinatorial problems”, Canadian J. of Math., 2 (1950), 93–99.CrossRefGoogle Scholar
4.Ryser, H. J., “A note on a combinatorial problem”, Proc. American Math. Soc., 1 (1950), 422–424.CrossRefGoogle Scholar
5.Hall, M. and Ryser, H. J., “Cyclic incidence matrices”, Canadian J. of Math., 3 (1951), 495–502.CrossRefGoogle Scholar
6.Hall, M., “A survey of difference sets”, Proc. American Math. Soc., 7 (1956), 975–986.CrossRefGoogle Scholar