H-designs with the properties of resolvability or (1, 2)-resolvability (Q1960214): Difference between revisions

An H-design is called \((1,\alpha)\)-resolvable if its blocks can be partitioned into \(\alpha\)-parallel classes, each containing every point \(\alpha\) times, or just resolvable if \(\alpha = 1\). The authors show that a resolvable H-design of type \(12^n\) exists for \(n \geq 4\) except possibly for 16 values, and that a \((1,2)\)-resolvable H-design of type \(2^n\) exists for \(n \geq 4\), \(n \equiv 1\) or \(2\) (mod \(3\)), except for \(n=5\) and possibly for 41 other values of \(n\), all odd. The second of these problems also provides information on existence of \((1,2)\)-resolvable H-designs of type \(1^{2n}\), more commonly known as \((1,2)\)-resolvable Steiner quadruple systems, RSQS\((1,2,2n)\). This is because existence of a \((1,2)\)-resolvable H-design of type \(2^n\) with \(n\) odd implies existence of a RSQS\((1,2,2n)\).