More large sets of resolvable MTS and resolvable DTS with odd orders (Q2470458)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5235177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More large sets of resolvable MTS and resolvable DTS with odd orders |
scientific article; zbMATH DE number 5235177 |
Statements
More large sets of resolvable MTS and resolvable DTS with odd orders (English)
0 references
14 February 2008
0 references
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.
0 references
Mendelsohn triple system
0 references
directed triple system
0 references
resolvable triple system
0 references
large set
0 references
0 references
0 references
0.98266107
0 references
0.92875797
0 references
0.8019414
0 references
0.7965861
0 references
0.7953053
0 references
0.7939009
0 references
0.79195035
0 references