✦ LIBER ✦

A cyclic steiner quadruple system of order 32

✍ Scribed by M.J. Grannell; T.S. Grigcs

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 172 KB
Volume: 38
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90175-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite families of strictly cyclic Ste

Infinite families of strictly cyclic Steiner quadruple systems

✍ Helmut Siemon 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 557 KB

For definitions and preliminary results see also Section 2. ' See Section 3.1. ' For the convenience of the reader we repeat here the argument of the proof of Theorem 1 in with 2p a instead of 2 5".

Product constructions for cyclic block d

Product constructions for cyclic block designs. I. Steiner quadruple systems

✍ M.J Grannell; T.S Griggs 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 568 KB

On the existence of cyclic Steiner Quadr

On the existence of cyclic Steiner Quadruple systems SQS (2p)

✍ Helmut Siemon 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 579 KB

Siemon, H., On the existence of cyclic Steiner Quadruple Systems SQS(2p), Discrete Mathematics 97 (1991) 377-385. Subsequent to Kohler's result in [l], Satz 8, we show that strictly cyclic SQS(2p), p prime number and p = 53, 77 ( 120) exist if a certain number theoretic claim can be proved. We verif

Steiner quadruple systems having a presc

Steiner quadruple systems having a prescribed number of quadruples in common

✍ Giovanni Lo Faro 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Constructions for cyclic 3-designs and i

Constructions for cyclic 3-designs and improved results on cyclic Steiner quadruple systems

✍ Tao Feng; Yanxun Chang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

This paper gives some recursive constructions for cyclic 3-designs. Using these constructions we improve Grannell and Griggs's construction for cyclic Steiner quadruple systems, and many known recursive constructions for cyclic Steiner quadruple systems are unified. Finally, some new infinite famili

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