Tripling construction for large sets of resolvable directed triple systems (Q2431920)

A directed triple system of order \(v\), \(\text{DTS}(v)\), is a pair \((X,V),\) where \(X\) is the underlying set of size \(v,\) and \(V\) is a set of directed triples, called blocks, so that each ordered pair of elements in \(X\) occurs in \(V\) exactly once. A \(\text{DTS}(v)\) is called resolvable if its blocks can be partitioned into parallel classes. Finally, the large set of resolvable \(\text{DTS}(v)\) is a collection \(C\) of resolvable \(\text{DTS}(v)\) so that each directed triple occurs in exactly one \(\text{DTS}(v)\) from \(C\). In the paper it is shown that the large set of resolvable \(\text{DTS}(v)\) exists for each \(v=4.3^{n},\) where \(n\geq 1.\)