More large sets of resolvable MTS and resolvable DTS with odd orders (Q2470458): Difference between revisions

Consider a Mendelsohn (resp. directed) triple system on a set \(X\) of order \(v\). Such a triple system is called resolvable if its blocks can be partitioned into subsets (called parallel classes), each containing every element of \(X\) exactly once. A large set \(L\) of Mendelsohn (resp. directed) triple systems is a union of Mendelsohn (resp. directed) triple systems such that every cyclic (resp. transitive) triple of elements of \(X\) occurs as a block in exactly one of the triple systems of \(L\). The paper contains a construction of large sets of resolvable Mendelsohn triple systems of order \(q+2\), where \(q=6t+1\) is a prime power. Using a computer, the authors found solutions for \(t \in T= \{35,38,46,47,48,51,56,60\}\). Furthemore, by a method introduced, large sets of resolvable directed triple systems of the same orders are obtained. Finally, by the tripling construction and product construction, the existence of large sets of both resolvable Mendelsohn and resolvable directed triple systems of orders \((6t+3)\Pi_{m\in M}(2\cdot 7^m+1)\Pi_{n\in N}(2\cdot 13^n+1)\), where \(t\in T\) and \(M\) and \(N\) are multisets of nonnegative integers, is shown.