Skip to main content

Room squares and subsquares

  • Invited Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics X

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1036))

Abstract

If a Room square of side s contains a Room subsquare of side t, then s≥3t+2. For t=3 or 5, there is no Room square of side t, yet one can construct (incomplete) Room squares of side s "missing" subsquares of side 3 or 5 (the same bound s≥3t+2 holds).

It has been conjectured that if s and t are odd, s≥3t+2 and (s,t)(5,1), then there exists a Room square of side s containing (or missing, if t=3 or 5) a subsquare of side t. Substantial progress has bee made toward proving this conjecture. In this paper we show that there exists a Room square of odd side s containing or missing a subsquare of odd side t provided s≥6t+41. For odd t≥127 and odd t≥4t+29, there exists a Room square of side s containing a subsquare of side t.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. E. Brouwer, The number of mutually orthogonal Latin squares-a table up to order 10000, Research report ZW 123/79, Mathematisch Centrum, Amsterdam, 1979.

    Google Scholar 

  2. R. J. Collens and R. C. Mullin, Some properties of Room squares — a computer search, Proc. First Louisiana Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, 1970, 87–111.

    Google Scholar 

  3. J. H. Dinitz and D. R. Stinson, Further results on frames, Ars Combinatoria 11 (1981), 275–288.

    MathSciNet  MATH  Google Scholar 

  4. J. H. Dinitz, D. R. Stinson and W. D. Wallis, Room squares with small holes, preprint.

    Google Scholar 

  5. R. C. Mullin and W. D. Wallis, The existence of Room squares, Aequationes Math. 13 (1975), 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  6. D. R. Stinson, Some constructions for frames, Room squares, and subsquares, Ars Combinatoria 12 (1981), 229–267.

    MathSciNet  MATH  Google Scholar 

  7. D. R. Stinson, Some results concerning frames, Room squares, and subsquares, J. Austral. Math. Soc. A 31 (1981), 376–384.

    Article  MathSciNet  MATH  Google Scholar 

  8. D. R. Stinson, The spectrum of skew Room squares, J. Austral. Math. Soc. A 31 (1981), 475–480.

    Article  MathSciNet  MATH  Google Scholar 

  9. W. D. Wallis, Supersquares, Combinatorial Mathematics, Proc. of the Second Australian Conf, 143–148.

    Google Scholar 

  10. W. D. Wallis, All Room squares have minimal supersquares, Congressus Numerantium, to appear.

    Google Scholar 

Download references

Authors

Editor information

Louis Reynolds Antoine Casse

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Stinson, D.R. (1983). Room squares and subsquares. In: Casse, L.R.A. (eds) Combinatorial Mathematics X. Lecture Notes in Mathematics, vol 1036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071510

Download citation

  • DOI: https://doi.org/10.1007/BFb0071510

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12708-6

  • Online ISBN: 978-3-540-38694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics