A few more Kirkman squares and doubly near resolvable BIBDs with block size 3 (Q2469988)

A Kirkman square, \({\mathrm{KS}}_k(v;\mu,\lambda)\), of index \(\lambda\), latinicity \(\mu\), block size \(k\), and order \(v\) is a \(t \times t\) array (\(t = (\lambda(v-1))/(\mu(k-1))\)) containing \(v\) symbols, so that each symbol occurs in \(\mu\) cells in each row and in each column; each cell is either empty or contains a \(k\)-set of symbols; and the \(k\)-sets in the nonempty cells form the blocks of a \((v,k,\lambda)\)-design. In this paper, the authors complete the determination for \({\mathrm{KS}}_3(v;1,2)\)s, \({\mathrm{KS}}_3(v;2,4)\)s, and doubly resolvable \((v,3,2)\)-designs by constructing designs for the six, two, and eight cases that had been open for these three types of designs. For \({\mathrm{KS}}_3(v;1,1)\), of the 23 cases left open \textit{C. J. Colbourn, E. R. Lamken, A. C. H. Ling}, and \textit{W. H. Mills}, Des. Codes Cryptography 26, 169--196 (2002; Zbl 0995.05021)], eleven are settled affirmatively in this paper, with the result that the necessary condition that \(v \equiv 3\pmod{6}\) is sufficient except when \(v \in \{9,15\}\) and possibly when \(v \in \{21, 141, 153, 165, 177, 189, 231, 249, 261, 285, 351, 357\}\).