Construction of large sets of pairwise disjoint transitive triple systems. II (Q1094428): Difference between revisions

A transitive triple is a 3-set of orderd pairs of the form \(\{\) (a,b),(b,c),(a,c)\(\}\). A transitive triple system (TTS) is a pair (S,T) where T is a collection of transitive triples of elements of S such that every ordered pair of distinct elements of S belongs to exactly one triple in T. The cardinality of S is called the order (denoted by v) of the TTS. A TTS of order v is known to exist iff \(v\equiv 0\) or 1 mod 3. The large set problem for TTS is to decompose the set of all v(v-1)(v-2) transitive triples from a v-set S (of admissible order) into 3(v-2) pairwise disjoint TTS on S. This problem was first studied by \textit{C. C. Lindner} and \textit{A. Penfold Street} [``Construction of large sets of pairwise disjoint transitive triple systems'', Eur. J. Comb. 4, 335-346 (1983; Zbl 0533.05010)]. The author substantially improves the known spectrum for large sets of TTS by means of recursive constructions. In particular, a large set of TTS exists for all admissible odd orders. Up to order 1000, only the two values 130 and 258 remain in doubt. (Prior to this paper, the smallest open case was 22.)