A Room t-cube of side n is a t-dimensional array of side n on a set S of \(n+1\) symbols such that: (i) Each cell is either empty or contains an unordered pair of distinct symbols from S, (ii) Each symbol occurs in every (t-1)-dimensional flat in the array exactly once, (iii) Every unordered pair of symbols occurs precisely once in the array. It is known that the existence of a Room t-cube of side n is equivalent to the existence of t pairwise orthogonal symmetric Latin squares of side n. In this paper the author proves that if \(n\geq 11\) is odd (except possibly \(n=15)\), then there is a Room 5-cube of side n. The proof involves a recursive construction using 5-dimensional frames. The author also conjectures that there is a Room 5-cube of side 15.
- A Fast Algorithm for Finding Strong Starters
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- scientific article; zbMATH DE number 3855125 (Why is no real title available?)
- scientific article; zbMATH DE number 3922704 (Why is no real title available?)
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 3668636 (Why is no real title available?)
- scientific article; zbMATH DE number 3706464 (Why is no real title available?)
- scientific article; zbMATH DE number 3786797 (Why is no real title available?)
- scientific article; zbMATH DE number 3628967 (Why is no real title available?)
- scientific article; zbMATH DE number 3428943 (Why is no real title available?)
- Room designs and one-factorizations
- The existence of Room squares
- The spectrum of Room cubes
- Orthogonal starters in finite abelian groups
- scientific article; zbMATH DE number 3855125 (Why is no real title available?)
- Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
- On the existence of three dimensional room frames and Howell cubes
- The spectrum of Room cubes
This page was built for publication: The existence of Room 5-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099181)