Completing partial latin squares with prescribed diagonals
نویسنده
چکیده
This paper deals with completion of partial latin squares L = (lij) of order n with k cyclically generated diagonals (li+t,j+t = lij + t if lij is not empty; with calculations modulo n). There is special emphasis on cyclic completion. Here, we present results for k = 2, . . . , 7 and odd n ≤ 21, and we describe the computational method used (hill-climbing). Noncyclic completion is investigated in the cases k = 2, 3 or 4 and n ≤ 21.
منابع مشابه
Completing Partial Latin Squares with Two Prescribed Diagonals
In the present paper we will prove that every partial latin square L = (lij) of odd order n with 2 cyclically generated diagonals (li+t,j+t = lij+t if lij is not empty; with calculations modulo n) can be cyclically completed.
متن کاملCompleting partial latin squares: Cropper's question
Hall’s condition is a well-known necessary condition for the existence of a proper coloring of a graph from prescribed lists. Completing a partial latin square is a very special kind of graph list-coloring problem. Cropper’s question was: is Hall’s condition sufficient for the existence of a completion of a partial latin square? The folk belief that the answer must be no is confirmed here, but,...
متن کاملLecture 4 : 3 SAT and Latin Squares
This talk’s focus is on the computational complexity of completing partial Latin squares. Our first goal in this talk is to show that for many special classes of partial Latin squares, we can construct completions for these objects in polynomial time. From here, we will prove the fairly surprising claim that completing an arbitrary partial Latin square is an NP-complete task; so while it is “ea...
متن کاملA note on the completion of partial latin squares
The problem of completing partial latin squares to latin squares of the same order has been studied for many years. For instance, in 1960 Evans [9] conjectured that every partial latin square of order n containing at most n− 1 filled cells is completable to a latin square of order n. This conjecture was shown to be true by Lindner [12] and Smetaniuk [13]. Recently, Bryant and Rodger [6] establi...
متن کاملCompletion of Partial Latin Squares
In this thesis, the problem of completing partial latin squares is examined. In particular, the completion problem for three primary classes of partial latin squares is investigated. First, the theorem of Marshall Hall regarding completions of latin rectangles is discussed. Secondly, a proof of Evans’ conjecture is presented, which deals with partial latin squares of order n containing at most ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 138 شماره
صفحات -
تاریخ انتشار 2004