Some new Latin power sets not based on groups (Q1279657)

Let \(R=(\alpha_0,\alpha_1,\ldots,\alpha_{n-1})\) and \(S=(\beta_0,\beta_1,\ldots,\beta_{n-1})\) be \(n \times n\) (row) Latin squares, where \(\alpha_i\) and \(\beta_i\) are permutations. The product RS is defined to be the square \((\alpha_0\beta_0,\alpha_1\beta_1,\ldots, \alpha_{n-1}\beta_{n-1})\), where \(\alpha_i\beta_i\) is the usual multiplication of permutations. If \(L\) is an \(n \times n\) Latin square and \(m\) a positive integer such that \(L^2,\ldots,L^m\) are all Latin squares, then the set (of mutually orthogonal) Latin squares \(\{ L,L^2,\ldots,L^m \}\) is called Latin power set of cardinality \(m\). The authors construct Latin power sets of \(p \times p\) squares for all primes \(p\geq 11\). All squares have in their broken diagonal (downwards to the right) all \(p\) symbols in cyclic natural order and the even degrees are no group tables. The construction makes use of circular Tuscan \(k\)-arrays.