A new bound on the number of designs with classical affine parameters

被引:7
作者
Lam, C [1 ]
Tonchev, VD
机构
[1] Concordia Univ, Dept Comp Sci, Montreal, PQ H3G 1M8, Canada
[2] Michigan Technol Univ, Dept Math Sci, Houghton, MI 49931 USA
关键词
D O I
10.1023/A:1016502619995
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The hyperplanes in the affine geometry AG(d, q) yield an affine resolvable design with parameters 2-(q(d), q(d-1), q(d-1)-1/q-1). Jungnickel [3] proved an exponential lower bound on the number of non-isomorphic affine resolvable designs with these parameters for d greater than or equal to 3. The bound of Jungnickel was improved recently [5] by a factor of q(d2)+d-6/2(q-1)(d-2) for any d greater than or equal to 4. In this paper, a construction of 2-(q(d), q(d-1), q(d-1)-1/q-1) designs based on group divisible designs is given that yields at least (q(d-1)+q(d-2)+...+1)!(q-1)/| PGammaL(d,q)|| AGammaL(d,q)| non-isomorphic designs for any d greater than or equal to 3. This new bound improves the bound of [5] by a factor of [GRAPHICS] For any given q and d, It was previously known [2,11] that there are at least 8071 non-isomorphic 2-(27,9,4) designs. We show that the number of non-isomorphic 2-(27,9,4) is at least 245,100,000.
引用
收藏
页码:111 / 117
页数:7
相关论文
共 11 条
[1]   COMBINATORIAL PROPERTIES OF GROUP DIVISIBLE INCOMPLETE BLOCK DESIGNS [J].
BOSE, RC ;
CONNOR, WS .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (03) :367-383
[2]  
COLBOURN CJ, 1996, CRC HDB COMBINATORIA, P16
[3]   SQUARE DIVISIBLE DESIGNS WITH K = (N + 1)-MU [J].
JUNGNICKEL, D ;
VEDDER, K .
ARCHIV DER MATHEMATIK, 1984, 43 (03) :275-284
[4]  
JUNGNICKEL D, 1984, GEOM DEDICATA, V16, P167
[5]   Bounds on the number of affine, symmetric, and Hadamard designs and matrices [J].
Lam, C ;
Lam, S ;
Tonchev, VD .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2000, 92 (02) :186-196
[6]   Classification of affine resolvable 2-(27,9,4) designs [J].
Lam, C ;
Tonchev, VD .
JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1996, 56 (02) :187-202
[7]   Classification of affine resolvable 2-(27, 9, 4) designs (vol 56, pg 187, 1996) [J].
Lam, C ;
Tonchev, VD .
JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2000, 86 (01) :277-278
[8]   Bounds on the number of Hadamard designs of even order [J].
Lam, C ;
Lam, S ;
Tonchev, VD .
JOURNAL OF COMBINATORIAL DESIGNS, 2001, 9 (05) :363-378
[9]  
Mullin R. C., 1996, The CRC Handbook of Combinatorial Designs, P185
[10]  
SHRIKHANDE SS, 1954, CALCUTTA STAT ASS B, V5, P139