scientific article; zbMATH DE number 1151839

From MaRDI portal
Publication:4387738





It is well known that a Steiner triple system (STS) can be constructed over a set \(S\) if and only if \(| S|\equiv 1, 3\pmod 6\). Two STS over the same set \(S\) are disjoint if they have no blocks in common. Using simple counting arguments, it is clear that there can be no more than \(| S|- 2\) pairwise disjoint STS over a given set \(S\) of suitable size and such a set of \(| S|- 2\) STS is called a large set. Determining whether or not large sets of STS exist is an old problem. The earliest results are due to A. Cayley, who showed that it is possible to construct only 2 disjoint STS with \(S= 7\) (so no large set of STS(7) exists) and T. R. Kirkman, who found a set of 7 disjoint (i.e., a large set of) STS(9). A more complete history can be found in \textit{T. S. Griggs} and \textit{A. Rosa} [Lond. Math. Soc. Lect. Note Ser. 218, 25-39 (1995; Zbl 0831.05014)] and in \textit{A. Rosa} [Ann. Discrete Math. 7, 115-128 (1980; Zbl 0438.05013)]. More recently, in a series of papers, J. X. Lu and L. Teirlinck have determined that large sets of \(\text{STS}(n)\) exist for all \(n\equiv 1, 3\pmod 6\) except \(n= 7\). However, a STS(7) is also a projective plane of order 2 and a STS(9) is an affine plane of order 3. So it seems natural to ask about the existence of large sets of projective and affine planes of given order. In 1983, L. G. Chouinard proved that large sets of projective planes of order 3 exist. In fact, he found 15 non-isomorphic large sets over a fixed point set. As might be expected, these sets were constructed with the aid of a computer (using a modified back-tracking algorithm). We decided to look at the next case, that of affine planes of order 4.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387738)