A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Resolvable bibd and sols

1983
*
Discrete Mathematics
*

The ideas of a base factorization and a resolvable grid system are introduced, and a construction of a resolvable balanced incomplete block design (BIBD) from these structures is given. Resolvable grid systems can be constructed from mutually orthogonal self-orthogonal latin squares (SOLS) with symmetric mate. Together these results prove, as a special case, that: if k -1 is an odd prime power and there exist J(k -2) mutually orthogonal SOLS of order n, with symmetric mate, then there exists a

doi:10.1016/0012-365x(83)90003-1
fatcat:xr6bapk2gvchzfybhqrhlcji6i