Partitioning sets of quadruples into designs. III (Q1182955)

It is shown that the collection of all \({11\choose 4}\) quadruples chosen from a set of eleven points can be partitioned into eleven mutually disjoint 3-(10,4,1) designs in precisely 21 nonisomorphic ways. If the set of all the \({v\choose k}\) \(k\)-sets chosen from a set \(X\) can be partitioned into \(v\) mutually disjoint \(t-(v-1,\;k,\lambda)\) designs, each missing a different point of \(X\), these designs form a overlarge set. In this paper \(X=\{0,1,\dots,9,A\}\), and designs are labelled by their missing element.