Some tuple system constructions with applications to resolvable designs (Q787991)

The authors generalize the well-known doubling and Kronecker product constructions for Hadamard matrices to the tuple systems introduced by Neumaier in his dissertation [see \textit{A. Neumaier}, J. Comb., Inf. Syst. Sci. 2, 41-96 (1977; Zbl 0399.05011)]. Translating their results into the standard language of design theory, they obtain recursive constructions for affine 2-designs and certain other resolvable designs, which are partly already due to Mavron, Kimberley and Mullin.