z-logo
Premium
Balanced incomplete block designs with block size 8
Author(s) -
Abel R. Julian R.,
Bluskov Iliya,
Greig Malcolm
Publication year - 2001
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.1010
Subject(s) - mathematics , block size , block (permutation group theory) , combinatorics , value (mathematics) , construct (python library) , basis (linear algebra) , type (biology) , block design , degree (music) , statistics , discrete mathematics , computer science , geometry , ecology , physics , computer security , key (lock) , acoustics , biology , programming language
The necessary conditions for the existence of a balanced incomplete block design on υ ≥  k points, with index λ and block size k , are that:$$\lambda ({\upsilon}-1) \equiv 0\;{\rm mod}\; (k-1)$$$$\lambda {\upsilon}({\upsilon}-1) \equiv 0\ {\rm mod}\; k(k-1)$$ For k  = 8, these conditions are known to be sufficient when λ = 1, with 38 possible exceptions, the largest of which is υ = 3,753. For these 38 values of υ, we show (υ, 8, λ ) BIBDs exist whenever λ > 1 for all but five possible values of υ, the largest of which is υ = 1,177, and these five υ's are the only values for which more than one value of λ is open. For λ>1, we show the necessary conditions are sufficient with the definite exception of two further values of υ, and the possible exception of 7 further values of υ, the largest of which is υ=589. In particular, we show the necessary conditions are sufficient for all λ> 5 and for λ = 4 when υ ≠ 22. We also look at (8, λ) GDDs of type 7 m . Our grouplet divisible design construction is also refined, and we construct and exploit α ‐ frames in constructing several other BIBDs. In addition, we give a PBD basis result for { n : n  ≡  0, 1; mod 8, n ≥ 8}, and construct a few new TDs with index > 1. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 233–268, 2001

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here