Recursive constructions for \(s\)-resolvable \(t\)-designs (Q2334440)

A \(t\)-\((v,k, \lambda)\) design \((\mathcal P,\mathcal B)\) is said to be \(s\)-resolvable with \(0 < s < t\), if its block set \(\mathcal B\) can be partitioned into \(N \ge 2\) classes \(\mathcal B_1, \ldots , \mathcal B_N\) such that each \((\mathcal P,\mathcal B_i)\), \(i=1, \ldots ,N\), is an \(s\)-\((v,k,\delta)\) design. The notion of an \(s\)-resolvable \(t\)-design is a generalization of the notion of a large set of \(s\)-designs. In this paper, the author gives recursive constructions of \(s\)-resolvable simple \(t\)-designs, for \(t \ge 3\) and \(1 \le s < t\). As an example, he gives a construction of an infinite family of 3-resolvable simple 4-designs with parameters 4-\((2^n+2,7,70(2^n-2)/3)\), \(\gcd(n,6)=1\), \(n \ge 5\).