Resolvable optimal strong partially balanced designs with block size four (Q2581409)

A partially balanced \(t\)-design, denoted by \(\text{PBD}(v,b, k;\lambda,o)\) where \(b\), \(v\), \(k\), \(\lambda\), \(t\) are positive integers with \(t\leq k\), is a pair \((X, B)\), \(X\) being a set with \(v\) elements and \(B\) is a colletion of \(b\) subsets of \(X\) (known as blocks) of size \(k\) such that each and every \(t\)-subset of \(X\) appears in exactly \(\lambda\) blocks of \(B\) or does not occur in any block. A partially balanced \(t\)-design is called a strong partially balanced \(t\)-design, denoted by \(\text{SPBD}(v, b, k;\lambda,o)\), if it is also a \(\text{PB}s\)-design where \(o< s< t\). \(\text{SPBD}(v, b, k,\lambda, o)\) is called optimal, denoted by \(\text{OSPBD}(v, b, k;\lambda, o)\), if \(b\) is the maximum number of blocks in all \(\text{SPBD}(v, b, k;\lambda, o)\). The symbol \(\text{OSPBD}(v,k,\lambda)\) denotes an optimal strong partially balanced 2-design. The following is the main result of this paper dealing with resolvable optimal strong partially balanced 2-designs denoted by \(\text{ROSPBD}(v,4,1)\). Theorem: There exists an \(\text{ROSPBD}(v,4, 1)\) for any positive integer \(v\equiv 0,1,3,4, 5,6,8,9\pmod{12}\) except \(v= 8,12,20\) and except possibly when \(v\in\{12t + 8\mid t= 5,7,8,11,13,15,16,19,\) \(21,23, 29,30,33,35,39, 41,55,57\}\cup\{12\times 23+ s\mid s= 5,6\}\).