Design theory
Existence of GBRDs with block size 4 and BRDs with block size 5
Designs, Codes and Cryptography
GBRDs over supersolvable groups and solvable groups of order prime to 3
Designs, Codes and Cryptography
Hi-index | 0.00 |
We solve the existence problem for generalized Bhaskar Rao designs of block size 3 for an infinite family of non-abelian groups, the dihedral groups Dn, of order 2n. In our main result we show that for n ≥ 1 and v ≥ 3 the following set of conditions is necessary and sufficient for the existence of a GBRD(v, 3, λ Dn): 1. λ ≡ 0 (mod 2n): 2. λ v(v - 1) ≡ 0 (mod 24).