Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-14T06:32:03.716Z Has data issue: false hasContentIssue false
  • English
  • Français

Some results concerning frames, Room squares, and subsquares

Part of: Designs and configurations

Published online by Cambridge University Press:  09 April 2009

D. R. Stinson
D. R. Stinson
Affiliation:
Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario, Canada
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.

Frames have been defined as a certain type of generalization of Room square. Frames have proven useful in the construction of Room squares, in particular, skew Room squares.

We generalize the definition of frame and consider the construction of Room squares and skew Room squares using these more general frames.

We are able to construct skew Room squares of three previously unknown sides, namely 93, 159, and 237. This reduces the number of unknown sides to four: 69, 87, 95 and 123. Also, using this construction, we are able to give a short proof of the existence of all skew Room squares of (odd) sides exceeding 123.

Finally, this frame construction is useful for constructing Room squares with subsquares. We can also construct Room squares “missing” subsquares of sides 3 and 5. The “missing” subsquares of sides 3 and 5 do not exist, so these incomplete Room squares cannot be completed to Room squares.

MSC classification

Secondary: 05B30: Other designs, configurations
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 31 , Issue 3 , October 1981 , pp. 376 - 384
Copyright
Copyright © Australian Mathematical Society 1981

References

1.Anderson, B. A., Muffin, R. C. and Stinson, D. R., ‘A few more skew Room squares’, Utilitas Math., submitted.Google Scholar
2.Brayton, R. K., Coppersmith, D. and Hoffman, A. J., ‘Self-orthogonal Latin squares of all orders n ≠ 2, 3, 6’, Bull. Amer. Math. Soc. 80 (1974), 116–118.CrossRefGoogle Scholar
3.Brouwer, A. E., ‘The number of mutually orthogonal Latin squares-a table up to order 10000’, Research Report ZW 123/79, Mathematisch Centrum, Amsterdam, 1979.Google Scholar
4.Dinitz, J. H. and Stinson, D. R., ‘The construction and uses of frames’, Ars Combinatoria 10, to appear.Google Scholar
5.Dinitz, J. H. and Stinson, D. K., ‘Further results on frames’, Ars Combinatoria, submitted.Google Scholar
6.Hall, M. Jr, Combinatorial theory (Blaisdell, Waltham, Mass. 1967).Google Scholar
7.McDougall, D. E. (private communication).Google Scholar
8.Mullin, R. C., Stinson, D. R. and Wallis, W. D., ‘Concerning the spectrum of skew Room squares’, Ars Combinatoria 6 (1978), 277–291.Google Scholar
9.Mullin, R. C. and Wallis, W. D., ‘The existence of Room squares’, Aequationes Math. 13 (1975), 1–7.CrossRefGoogle Scholar
10.Stinson, D. R., ‘A skew Room square of order 129’, Discrete Math. 31 (1980), 333–335.CrossRefGoogle Scholar