Diagonal-complete Latin squares
A Latin square \((a_{ij})\) of order \(n\) is called right-diagonal-complete (resp. left-diagonal-complete) if \(\{(a_{ij},a_{i+1,j+1}):1 \leq i,j \leq n\} =\{(i,j):1 \leq i,j \leq n\}\) (resp. \(\{(a_{ij},a_{i+1,j-1}):1 \leq i,j \leq n\} =\{(i,j):1 \leq i,j \leq n\}\)) and diagonal-complete if it is simultaneously right-diagonal-complete and left-diagonal-complete. In the paper under review, the authors introduce the above notions, construct diagonal-complete Latin squares of order \(n=4m\) and show that no group type diagonal-complete Latin squares of order \(n=4m+2\) exist. Some small cases are considered as well.
- Full and quarter plane complete infinite Latin squares
- Completing partial Latin squares with two cyclically generated prescribed diagonals
- Diagonally cyclic Latin squares.
- Completing partial Latin squares with prescribed diagonals.
- Complete latin squares of order \(2^ k\)
- scientific article; zbMATH DE number 3997810 (Why is no real title available?)
- scientific article; zbMATH DE number 840684 (Why is no real title available?)
This page was built for publication: Diagonal-complete Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395006)
