THE EXISTENCE OF SKEW HOWELL DESIGNS OF SIDE 2N AND ORDER 2N+2

被引:7
|
作者
LAMKEN, ER [1 ]
VANSTONE, SA [1 ]
机构
[1] UNIV WATERLOO,DEPT MATH,WATERLOO N2L 3G1,ONTARIO,CANADA
关键词
D O I
10.1016/0097-3165(90)90003-F
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A Howell design of side s and order 2n, or more briefly an H(s, 2n), is an s × s array in which each cell is either empty or else contains an unordered pair of elements from some 2n-set, say X, such that 1. (1) each row and each column is Latin (i.e., every element of X is in precisely one cell of each row and each column) and 2. (2) every unordered pair of elements from X is in at most one cell of the array. Necessary conditions on the parameters s and n are n ≤ s ≤ 2n -1. The existence question for H(2n, 2n + 2) was settled in 1977 by Schellenberg, van Rees, and Vanstone and the existence question for complementary H(2n, 2n + 2) was settled in 1985 by Lamken and Vanstone: for n a positive integer, n ≥ 2, there exists a complementary H(2n, 2n + 2). The existence of *complementary H(2n, 2n + 2) was also established with a finite number of possible exceptions. In this paper, we prove the existence of skew H(2n, 2n + 2)s for n a positive integer, n ≥ 2, n ≠ 3 with the possible exceptions of n = 5 and n = 9. We also improve the existence result for *complementary H(2n, 2n + 2)s to prove the existence of *complementary H(2n, 2n + 2)s for all positive integers n, n ≥ 2. © 1990.
引用
收藏
页码:20 / 40
页数:21
相关论文
共 50 条
  • [1] THE EXISTENCE OF HOWELL DESIGNS OF SIDE N+1 AND ORDER 2N
    SCHELLENBERG, PJ
    STINSON, DR
    VANSTONE, SA
    YATES, JW
    COMBINATORICA, 1981, 1 (03) : 289 - 301
  • [2] Existence of generalized Howell designs of side n+1 and order 3n
    Wang, Changyuan
    Du, Beiliang
    UTILITAS MATHEMATICA, 2009, 80 : 143 - 159
  • [3] A Residue to Binary Converter for the {2n+2, 2n+1, 2n} Moduli Set
    Gbolagade, Kazeem Alagbe
    Cotofana, Sorin Dan
    2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, : 1785 - 1789
  • [4] On 2 – (n2, 2n, 2n–1) designs with three intersection numbers
    Andrea Caggegi
    Giovanni Falcone
    Designs, Codes and Cryptography, 2007, 43 : 33 - 40
  • [5] Existence of regular 3-polytopes of order 2n
    Hou, Dong-Dong
    Feng, Yan-Quan
    Leemans, Dimitri
    JOURNAL OF GROUP THEORY, 2019, 22 (04) : 579 - 616
  • [6] NESTED FRACTIONS OF 2N DESIGNS
    JOHN, PWM
    BULLETIN OF THE INTERNATIONAL STATISTICAL INSTITUTE, 1965, 41 (02): : 842 - 842
  • [7] PROJECTIVE (2N,N,LAMBDA,1)-DESIGNS
    ERDOS, P
    FABER, V
    JONES, F
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1982, 7 (02) : 181 - 191
  • [8] GROUPS OF ORDER 2N(N[=6)
    不详
    MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 335 - &
  • [9] New weighing matrices of order 2n and weight 2n - 5
    Kotsireas, Ilias S.
    Koukouvinos, Christos
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2009, 70 : 197 - 205
  • [10] GROUPS OF ORDER 2N(N[-6)
    TODD, OT
    AMERICAN SCIENTIST, 1965, 53 (02) : A230 - &