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

preprint2016arXivOpen access

Abstract

In this note we show that for each Latin square LL of order n≥2n\geq 2, there exists a Latin square L′≠LL'\neq L of order nn such that LL and L′L' differ in at most 8n8\sqrt{n} cells. Equivalently, each Latin square of order nn contains a Latin trade of size at most 8n8\sqrt{n}. We also show that the size of the smallest defining set in a Latin square is Ω(n3/2)Ω(n^{3/2}). %That is, there are constants cc and n0n_0 such that for any n>n0n>n_0 the size of the smallest defining %set of order nn is at least cn3/2cn^{3/2}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.