Further results on fine structures of three Latin squares
نویسندگان
چکیده
Denote by Fin(v) the set of all integer pairs (t, s) for which there exist three Latin squares of order v on the same set having fine structure (t, s). The set Fin(v) with v ≥ 2 and v = 5, 6, 7, 8 is determined in [2]. In the present article the set Fin(8) is finally determined. Some results on Fin(v) with 5 ≤ v ≤ 7 are also updated.
منابع مشابه
The completion of partial Latin squares
In recent times there has been some interest in studying partial latin squares which have no completions or precisely one completion, and which are critical with respect to this property. Such squares are called, respectively, premature partial latin squares and critical sets. There has also been interest in related maximal partial latin squares. This paper will explore the connection between t...
متن کاملتحلیل حرکت جریانات دریائی در تصاویر حرارتی سطح آب دریا
Oceanographic images obtained from environmental satellites by a wide range of sensors allow characterizing natural phenomena through different physical measurements. For instance Sea Surface Temperature (SST) images, altimetry data and ocean color data can be used for characterizing currents and vortex structures in the ocean. The purpose of this thesis is to derive a relatively complete frame...
متن کاملQuantum Latin squares and unitary error bases
We introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares. We show that quantum Latin squares can be seen as weakened versions of mutually-unbiased bases (MUBs). Our main results use quantum Latin squares to give a new construction of unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as ...
متن کاملUpper bounds on sets of orthogonal colorings of graphs
We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two n-colorings of a graph are said to be orthogonal if whenever two vertices share a color in one coloring they have distinct colors in the other coloring. We show that the usual bounds on the maximum size of a certain set of orthogonal latin structures such as latin squares, row latin squares, equi-n squares, ...
متن کاملSpecifying Latin Square Problems in Propositional Logic
This chapter discusses how to specify various Latin squares so that their existence can be eeciently decided by computer programs. The computer programs considered here are so-called general-purpose model generation programs (or simply model generators) that are used to solve constraint satisfaction problems in AI, to prove theorems in nite domains, or to produce counterexamples to false conjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 42 شماره
صفحات -
تاریخ انتشار 2008