Complete latin squares of order 2^ k
From MaRDI portal
It is proved that the \(n\times n\) matrix with \((i, j)\) entry \((i(i- 1)+ j(j- 1))/2\) calculated modulo \(n\) is a complete latin square of order \(n\) if and only if \(n\) is a power of 2. We remind the reader that a latin square is complete if each pair of distinct elements appears as a pair of adjacent entries exactly once in some row and also in some column.
Recommendations
Cited in
(9)- Latin square determinants II
- Complete Latin squares of order \(p^n\) exist for odd primes \(p\) and \(n>2\)
- Embedding cyclic Latin squares of order 2^ n in a complete set of orthogonal F-squares
- scientific article; zbMATH DE number 4143993 (Why is no real title available?)
- scientific article; zbMATH DE number 4095471 (Why is no real title available?)
- scientific article; zbMATH DE number 54789 (Why is no real title available?)
- Simple perfect squared squares and 2×1 squared rectangles of order 26
- scientific article; zbMATH DE number 2188430 (Why is no real title available?)
- New complete Latin squares of odd order
This page was built for publication: Complete latin squares of order \(2^ k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901050)