Finding orthogonal latin squares using finite model searching tools

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly Orthogonal Latin Squares

A Latin square of order n is an n by n array in which every row and column is a permutation of a set N of n elements. Let L = [li,j ] and M = [mi,j ] be two Latin squares of even order n, based on the same N -set. Define the superposition of L onto M to be the n by n array A = (li,j ,mi,j). When n is even, L and M are said to be nearly orthogonal if the superposition of L onto M has every order...

متن کامل

More mutually orthogonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.

متن کامل

iMOLSDOCK: Induced-fit docking using mutually orthogonal Latin squares (MOLS).

We have earlier reported the MOLSDOCK technique to perform rigid receptor/flexible ligand docking. The method uses the MOLS method, developed in our laboratory. In this paper we report iMOLSDOCK, the 'flexible receptor' extension we have carried out to the algorithm MOLSDOCK. iMOLSDOCK uses mutually orthogonal Latin squares (MOLS) to sample the conformation and the docking pose of the ligand an...

متن کامل

Orthogonal latin squares of Sudoku type

Orthogonal latin squares of Sudoku type Hans-Dietrich Gronau Universität Rostock, Inst. für Mathematik 18051 Rostock, Germany We present results on the existence of orthogonal latin squares and latin rectangles of Sudoku type.

متن کامل

Enumeration of self-orthogonal Latin squares

The enumeration of self-orthogonal Latin squares (SOLS) of a given order seems to be an open problem in the literature on combinatorial designs. The existence of at least one SOLS is guaranteed for any order except 2, 3 and 6, but it is not known how many of these squares of a given order exist. In this talk we present enumeration tables of unequal SOLS, idempotent SOLS, isomorphism classes of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2011

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-011-4343-3