The last twenty orders of (1,2)-resolvable Steiner quadruple systems (Q1759400)

A Steiner quadruple system of order \(v\), denoted by \(\text{SQS}(v)\), is a pair \((X,\mathcal{B})\) where \(X\) is a \(v\)-set of points and \(\mathcal{B}\) is a set of \(4\)-subsets of \(X\), called blocks, with the property that every \(3\)-subset of \(X\) is contained in exactly one block of \(\mathcal{B}\). It is known that an \(\text{SQS}(v)\) exists if and only if \(v \equiv 2\) or \(4 \pmod 6\). An \(\text{SQS}(X,\mathcal{B})\) is said to be \((1,2)\)-resolvable, denoted by \(\text{RSQS}(1, 2, v)\) if its blocks can be partitioned into \(r\) parts such that each point of \(X\) occurs in exactly two blocks in each part. The necessary condition for the existence of an \(\text{RSQS}(1,2,v)\) is \(v \equiv 2\) or \(10 \pmod {12}\). \textit{A. Hartman} and \textit{K. T. Phelps} [Contemporary design theory, Collect. Surv., 205--240 (1992; Zbl 0765.05017)] raise the question that whether the necessary condition for the existence of \((1,2)\)-resolvable Steiner quadruple systems is also sufficient. Recently, \textit{X. Zhang} and \textit{G. Ge} [Des. Codes Cryptography 55, No. 1, 81--101 (2010; Zbl 1227.05078)] proved that the necessary conditions for the existence of an \(\text{RSQS}(1,2,v)\) are also sufficient except for \(v \neq10\) and possibly for \[ \begin{multlined} v\in\{82, 110, 118, 122, 130, 146, 230, 262, 298, 346, 358, 370, 386,\\ 430, 470, 562, 670, 758, 778, 982, 1010, 1018, 1030, 1070, 1082, 1090, 1094, 1198, 1658,\\ 1678, 1858, 2206, 2242, 2306, 2630, 2830, 2918, 2930, 3070, 3142, 3202\}. \end{multlined} \] \textit{Z. Meng} et al. [Discrete Math. 312, No. 12--13, 1968--1978 (2012; Zbl 1243.05043)] reduced the above unsettled cases to twenty values of \(v\). In the paper under review the remaining twenty values are settled. Therefore, now we have that an \(\text{RSQS}(1,2,v)\) exists if and only if \(v \equiv 2\) or \(10 \pmod{12}\) and \(v>10\).