Weak critical sets in cyclic Latin squares
نویسندگان
چکیده
We identify a weak critical set in each cyclic latin square of order greater than 5. This provides the first example of an infinite family of weak critical sets. The proof uses several constructions for latin interchanges which are generalisations of those introduced by Donovan and Cooper.
منابع مشابه
Critical sets in orthogonal arrays with 7 and 9 levels
To date very few results are known on the critical sets for a set of Mutually Orthogonal Latin Squares(MOLS). In this paper, we consider Orthogonal Array OA(n, k + 2, n, 2) constructed from k mutually orthogonal cyclic latin squares of order n and obtain bounds on the possible sizes of the minimal critical sets. In particular, for n = 7 we exhibit a critical set, thereby improving the bound rep...
متن کاملLatin squares and critical sets of minimal size
IsotoIHsl:n that lower bounds for infinite N of order n. hand or computer, strong critical sets of minimum nOn-lS01110Tnitnc reduced latin squares of order less than or of order 6. These latin squares have been taken from 129 onwards. We summarise our results in Table the numbering system listed by Denes and Keedwell latin squares. This numbering system is based on the ,<:n,,-r1i',rrHl1<:rn cla...
متن کاملSteiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...
متن کاملA census of critical sets in the Latin squares of order at most six
A critical set in a Latin square of order n is a set of entries in a Latin square which can be embedded in precisely one Latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the num...
متن کاملDiagonally cyclic latin squares
A latin square of order n possessing a cyclic automorphism of order n is said to be diagonally cyclic because its entries occur in cyclic order down each broken diagonal. More generally, we consider squares possessing any cyclic automorphism. Such squares will be named after Parker, in recognition of his seminal contribution to the study of orthogonal latin squares. Our primary aim is to survey...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2001