A few more incomplete self-orthogonal Latin squares and related designs

نویسندگان

  • R. Julian R. Abel
  • Frank E. Bennett
  • Hantao Zhang
  • Lie Zhu
چکیده

An incomplete self-orthogonal Latin square of order v with an empty subarray of order n, an ISOLS(v, n), can exist only if v ~ 3n + 1. This necessary condition is known to be sufficient apart from 2 known exceptions (v, n) = (6,1) and (8,2) plus 14 possible exceptions (v, n) with v = 3n + 2. In this paper, we construct eleven new ISOLS(3n + 2, n) reducing unknown n to 6, 8,10 only. This result is then used to improve the existence of HSOLS of type 3 u1• To do this, two newly found unipotent SOLSSOMs, SOLSSOM(66) and SOLSSOM(70) are also useful. "'Research supported in part by NSERC Grant OGP 0005320 for the second author; NSF Grants CCR-9504205 and CCR-9357851 for the third author; and NSFC Grant 19831050 for the

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

ثبت نام

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

منابع مشابه

Incomplete self-orthogonal latin squares ISOLS(6m + 6, 2m) exist for all m

Heinrich, K., L. Wu and L. Zhu, Incomplete self-orthogonal latin squares ISOLS(6m + 6, 2m) exist fo all m, Discrete Mathematics 87 (1991) 281-290. An incomplete self-orthogonal latin square of order v with an empty subarray of order n, an ISOLS(v, n) can exist only if v 2 3n + 1. We show that an ISOLS(6m + 6, 2m) exists for all values of m and thus only the existence of an ISOLS(6m + 2,2m), m 2...

متن کامل

A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6

The non-existence of a pair of mutually orthogonal Latin squares of order six is a well-known result in the theory of combinatorial designs. It was conjectured by Euler in 1782 and was first proved by Tarry [4] in 1900 by means of an exhaustive enumeration of equivalence classes of Latin squares of order six. Various further proofs have since been given [1, 2, 3, 5], but these proofs generally ...

متن کامل

On the existence of self-orthogonal diagonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...

متن کامل

Mutually Orthogonal Latin Squares and Self-complementary Designs

Suppose that n is even and a set of n 2 − 1 mutually orthogonal Latin squares of order n exists. Then we can construct a strongly regular graph with parameters (n, n 2 (n−1), n 2 ( 2 −1), n 2 ( 2 −1)), which is called a Latin square graph. In this paper, we give a sufficient condition of the Latin square graph for the existence of a projective plane of order n. For the existence of a Latin squa...

متن کامل

Existence of HSOLSSOMs of type 4nu1

This paper investigates the existence of holey self-orthogonal Latin squares with a symmetric orthogonal mate of type 4u (briefly HSOLSSOM(4u)). For u > 0, the necessary conditions for existence of such an HSOLSSOM are (1) u must be even, and (2) u ≤ (4n−4)/3, and either (n, u) = (4, 4) or n ≥ 5. We show that these conditions are sufficient except possibly (1) for 36 cases with n ≤ 37, (2) for ...

متن کامل

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


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

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2000