On the distances between Latin squares and the smallest defining set size

Abstract

In this note we show that for each Latin square L of order n≥ 2, there exists a Latin square L'≠ L of order n such that L and L' differ in at most 8n cells. Equivalently, each Latin square of order n contains a Latin trade of size at most 8n. We also show that the size of the smallest defining set in a Latin square is (n3/2). %That is, there are constants c and n0 such that for any n>n0 the size of the smallest defining %set of order n is at least cn3/2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…