The three-way intersection problem for latin squares

The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n(2) - k cells different in all three latin squares, denoted by I-3[n], is determined here for all orders n. In particular, it is shown that I-3[n] = {0,...,n(2) - 15} {n(2) - 12,n(2) - 9,n(2)} for n greater than or equal to 8. (C) 2002 Elsevier Science B.V. All rights reserved.

Latin interchanges and direct products

In this paper we focus on the identification of latin interchanges in latin squares which are the direct product of latin squares of smaller orders. The results we obtain on latin interchanges will be used to identify critical sets in direct products. This work is an extension of research carried out by Stinson and van Rees in 1982.