## Abstract The obvious necessary conditions for the existence of a nested Steiner triple system of order __v__ containing a nested subsystem of order __w__ are __v__ββ₯β3__w__β+β4 and __v__ββ‘βwββ‘β1 (mod 6). We show that these conditions are also sufficient. Β© 2004 Wiley Periodicals, Inc.
An orbit theorem for Steiner triple systems
β Scribed by Peter J. Cameron
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 206 KB
- Volume
- 125
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
An automorphism
group of a nontrivial (possibly infinite) Steiner triple system has at least as many block-orbits as point-orbits.
The proof is a translation of that in the finite case, with a small twist. For block size 4, the argument fails, and, indeed, the stronger statement (involving block-tactical decompositions) is false.
An orbit theorem for an incidence structure (X,6@ is typically the assertion that any automorphism group has at least as many orbits on the block set 29 as on the point set X. I will briefly consider how such a theorem is proved for finite structures, in order to extend it to infinite ones.
Let Rx and IwB denote the real vector spaces of real-valued functions on points and blocks, respectively. The incidence transformation is the map 1: [w*+lR~ defined by
for XEX, BE$~. It is the transformation whose matrix, relative to the bases consisting of characteristic functions of singletons, is the incidence matrix of the structure.
If G is a group acting on X, then the dimension of the space Fixc(Rx) of fixed functions for G in Rx is equal to the number of G-orbits in X -a basis for Fix&Rx) consists of the characteristic functions of the G-orbits. If G is a group of automorphisms of (X, @), then 1 maps Fix&RX) into Fix,@"). Hence, we have the following proposition.
π SIMILAR VOLUMES
Given a Steiner system S(2,k-1;v) with v>~vo(k), there is a 3-design Sa(3, k;v+ t) such that the derived design is 2 copies of the Steiner system for any 2 sufficiently large satisfying the standard arithmetic conditions. This theorem has applications in the construction of Steiner 3-designs.
## Abstract In this paper, we present a recursive construction for antiβmitre Steiner triple systems. Furthermore, we present another construction of antiβmitre STSs by utilizing 5βsparse ones. Β© 2004 Wiley Periodicals, Inc.
We develop some recursive constructions for rotational Steiner triple systems with which the spectrum of a k-rotational Steiner triple system of order v is completely determined for each positive integer k .