A Room square of side , , is an -array defined on an -set with the following properties:
1) each cell of is either empty or contains an unordered pair of distinct elements from ;
2) each element of occurs precisely once in each row and column of ;
3) every unordered pair of elements from is in precisely one cell of . A necessary condition for a Room square of side to exist is that be odd. An example of a Room square of side is listed below.
Room squares were named after T.G. Room, who published a paper in 1955 in which he constructed a Room square of side and proved that Room squares of side and do not exist. However, Room squares were actually constructed much earlier. In 1850, T.M. Kirkman used a Room square of side to solve the Kirkman schoolgirl problem for girls, and the first infinite classes of Room squares were constructed by R.R. Anstice in 1852– 1853 [a1]. Several small Room squares were also constructed by E.C. Howell for use as schedules for duplicate bridge tournaments at the end of the nineteenth century. The existence of Room squares was finally completed in the early 1970s by R.C. Mullin and W.D. Wallis [a4]: A Room square of side exists if and only if is odd and or . The proof uses a number of direct and recursive constructions. An extensive literature on Room squares is available, see [a3].
One application of Room squares is in the construction of round robin tournaments. A Room square of side can be used to construct a round robin tournament with teams which has the following properties: every team plays every other team exactly once during the tournament; every team plays in exactly one game in each round; and every team plays at every location exactly once.
A Room square of side is standardized with respect to the element if cell contains the pair . A standardized Room square of side is skew if for every pair of cells and (with ) exactly one is filled. The existence of skew Room squares has been established [a5]: There exists a skew Room square of side if and only if is odd and or . Skew Room squares have been quite useful in constructions for several other types of combinatorial designs, see [a3].
Room squares with additional properties have also been studied; these include Room squares with sub-Room squares (incomplete Room squares), maximum empty subarray Room squares, perfect Room squares, and balanced Room squares (complete balanced Howell rotations), see [a3] for references. For generalizations of Room squares to larger block size and higher dimension, see Design with mutually orthogonal resolutions.
Room squares are equivalent to several other combinatorial configurations, [a2]. In particular, the existence of the following designs are equivalent:
a) a Room square of side ;
b) a Room frame of type ;
c) two pairwise orthogonal symmetric Latin squares of order n (see Latin square);
d) a Howell design, ;
e) two pairwise orthogonal one-factorizations of (cf. also One-factorization);
f) two orthogonal resolutions of an -BIBD (see Design with mutually orthogonal resolutions).
In some of the earlier literature, Room squares are also called Room designs.
|[a1]||I. Anderson, "Cyclic designs in the 1850s; the work of Rev. R.R. Anstice" Bull. ICA , 15 (1995) pp. 41–46|
|[a2]||J.H. Dinitz, "Room squares" C.J. Colbourn (ed.) J.H. Dinitz (ed.) , CRC Handbook of Combinatorial Designs , CRC (1996) pp. 437–442|
|[a3]||J.H. Dinitz, D.R. Stinson, "Room squares and related designs" J.H. Dinitz (ed.) D.R. Stinson (ed.) , Contemporary Design Theory: A Collection of Surveys , Wiley (1992) pp. 137–204|
|[a4]||R.C. Mullin, W.D. Wallis, "The existence of Room squares" Aequat. Math. , 13 (1975) pp. 1–7|
|[a5]||D.R. Stinson, "The spectrum of skew Room squares" J. Austral. Math. Soc. A , 31 (1981) pp. 475–480|
Room square. Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Room_square&oldid=42966