𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclically resolvable cyclic Steiner triple systems of order 21 and 39

✍ Scribed by Clement W.H. Lam; Ying Miao

Book ID
108316446
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
103 KB
Volume
219
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A construction of cyclic Steiner triple
A construction of cyclic Steiner triple systems of order pn
✍ K.T Phelps πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 230 KB

## 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~),

Existence of non-resolvable Steiner trip
Existence of non-resolvable Steiner triple systems
✍ (Ben) Pak Ching Li; G. H. J. van Rees πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 112 KB πŸ‘ 1 views

## Abstract We consider two well‐known constructions for Steiner triple systems. The first construction is recursive and uses an STS(__v__) to produce a non‐resolvable STS(2__v__ + 1), for __v__ ≑ 1 (mod 6). The other construction is the Wilson construction that we specify to give a non‐resolvable