A construction of cyclic Steiner triple systems of order pn
β Scribed by K.T Phelps
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 230 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Phelps
2.1 will produce such a collection for each n -1/> 1. Choose U as in (3.1) above, then B,, =pBn-1 U U is a set of representatives for a CSTS(p"). Since every multiplier m =-1 (modp n'l) is an automorphism of this system f(x)=p"-lx2 +x will be an isomorphism from B,, to another CSTS(p~), B~. Since f(x) fixes the orbits in pBn_~, pB~_t will be a form sub-CSTS(p "-~) in B" and thus any multiplier isomorphism from B~ to B" must first be a multiplier automorphism (modp "-1) of Bn-1. By choice of B,,_~, the multiplier m must be congruent to 1, a m, or tr 4' (modp "-x) but then the multiplier will be a multiplier automorphism for B~.
π SIMILAR VOLUMES
## Abstract In this paper, we present a conjecture that is a common generalization of the DoyenβWilson Theorem and Lindner and Rosa's intersection theorem for Steiner triple systems. Given __u__, __v__ β‘ 1,3 (mod 6), __u__ < __v__ < 2__u__β+β 1, we ask for the minimum __r__ such that there exists a
In this paper, we enumerate the 2-rotational Steiner triple systems of order 25. There are exactly 140 pairwise non-isomorphic such designs. All these designs have full automorphism groups of order 12. We also investigate the existence of subsystems and quadrilaterals in these designs.