Solution of the Intersection Problem for Latin Squares of Different Orders

Peter Dukes1, Jared Howell1
1Mathematics and Statistics University of Victoria Victoria, BC V8W 3R4 Canada

Abstract

A complete solution is obtained for the possible number of common entries between two Latin squares of different given orders. This intersection problem assumes the entries of the smaller square are also entries of the larger, and that, for comparison, the smaller square is overlayed on the larger. However, these extra restrictions do not affect the solution, apart from one small example.