The four-way intersection problem for latin squares

Abstract: For

m u

given latin squares of order

n

, they have {sf

k

intersection} when they have

k

identical cells and

n^{2} - k

cells with mutually different entries. For each

n g e q 1

the set of integers

k

such that there exist

m u

latin squares of order

n

with

k

intersection is denoted by

I^{m u} [n]

. In a paper by P. Adams et al. (2002),

I^{3} [n]

is determined completely. In this paper we completely determine

I^{4} [n]

for

n g e q 16

. For

n l e 16

, we find out most of the elements of

I^{4} [n]

.

Recommendations

Cited in

(9)

This page was built for publication: The four-way intersection problem for latin squares