Number of maximal subsystems of Steiner triple systems (Q1312687): Difference between revisions

Let \(V\) be a finite set of points with \(| V|=v\geq 3\) and \(B\) be a set of 3-sets of points (straight lines). Furthermore, suppose that every 2-set of points is included in one and only one straight line. Then the structure \((V,B)\) is called a Steiner triple system of order \(v\), briefly STS\((v)\). If \(v (\neq 3,7)\) is a Steiner number (SZ), then let \(N(v)\) be the set of numbers \(h\in N_ 0\), for which there is a STS\((v)\) with exactly \(h\) subsystems STS\((r)\). This paper treats the problem how to find the sets \(N(v)\). The author gives a comprehensive and readable introduction into the subject and related problems: theorems of existence, important connections (projective spaces), a recursive method for the construction of a STS\((2v+1)\) from a STS\((v)\) (briefly \(Z\)-method), and so on. By the \(Z\)- method the following new result is established: If \(v\neq 3\), 7 is a Steiner number, then \[ N(v)=\Bigl\{2^ n-1:\quad n\in N_ 0\quad\text{and}\quad{1\over 2^ n}(v-2^ n+1)\in\text{SZ}\cup\{0,1\}\Bigr\}. \]