Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares (Q2266556)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares |
scientific article |
Statements
Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares (English)
0 references
1984
0 references
A cyclic Latin square or order \(2^ n\), which has no orthogonal Latin square mate, is shown to have \((2^ n-1)(2^ n-2)\) mutually orthogonal \(F(2^ n;2^{n-1},2^{n-1})\)-squares. This is a complete set of F- squares for the cyclic Latin square. Row and columm operations are used to construct this complete set of F-squares from a Hadamard matrix and \(2^ n-1\) \(OF(2^ n;2^{n-1},2^{n-1})\)-squares into which the Latin square is decomposed. Tables of complete sets of mutually orthogonal \(F(2^ n;2^{n-1},2^{n-1})\)-squares are given for \(n=2\) and 3, i.e., for cyclic Latin squares of orders 4 and 8.
0 references
orthogonal F-squares
0 references
Hadamard product
0 references
cyclic Latin square
0 references
complete set of F-squares
0 references
Hadamard matrix
0 references
Tables
0 references
0 references
0 references