Resolvable group divisible designs with block size four and group size six (Q1398260): Difference between revisions

A group divisible design (GDD) is a triple \(({\mathcal V},{\mathcal G},{\mathcal B})\), where \({\mathcal G}\) is a partition of a set \({\mathcal V}\) (of points) into subsets called groups, \({\mathcal B}\) is a set of subsets of \({\mathcal V}\) (called blocks) such that a group and a block contain at most one common point, and every pair of points from distinct groups occurs in exactly \(\lambda\) blocks. A GDD is said to be resolvable if its blocks can be partitioned into parallel classes each of which partitions the set of points. The authors study the existence of resolvable GDDs with \(\lambda = 1\), blocks of size 4 and \(n\) groups of size 6 (type \(6^n\)). They show that the necessary condition, \(n \geq 4\) even, is sufficient with the exception \(n = 4\) and the possible exceptions \(n \in \{6,52,54,58,62,68,74,102,114,124\}\).