✦ LIBER ✦

The existence of simple S3(3, 4, v)

✍ Scribed by K. Phelps; D.R. Stinson; S.A. Vanstone

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 214 KB
Volume: 77
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90364-6

No coin nor oath required. For personal study only.

✦ Synopsis

It has been known for some time that an Ss(3, 4, v) exists iff v is even. The constructions which prove this result, in general, give designs having repeated blocks. Recently, it was shown that a simple Ss(3, 4, v) exists if v is even and v 3.4 (mod 12). In this paper we give an elementary proof of the existence of simple Ss(3, 4, v)s for all even v, v > 4.

📜 SIMILAR VOLUMES

Existence results for KS3(v; 2, 4)s

✍ E.R Lamken; S.A Vanstone 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 799 KB

A Kirkman square with index 2, latinicity #, block size k and v points, KSk(v; #, Z), is a t x t array (t = 3.(v -1)/#(k -1)) defined on a v-set V such that (1) each point of V is contained in precisely # cells of each row and column, (2) each cell of the array is either empty or contains a k subset

On resolvable designs S3(3; 4, v)

✍ Dieter Jungnickel; Scott A Vanstone 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Existence of T*(3, 4,v)-codes

✍ J. Wang; L. Ji 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract A word of length __k__ over an alphabet __Q__ of size __v__ is a vector of length __k__ with coordinates taken from __Q__. Let __Q__^\*^~4~ be the set of all words of length 4 over __Q__. A __T__^\*^(3, 4, __v__)‐code over __Q__ is a subset __C__^\*^⊆ __Q__^\*^~4~ such that every word o

On the existence of (v, 4, 3, 1)-BHDs

✍ Francis Maurin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 98 KB

On the existence of super-simple (v,4,4)

On the existence of super-simple (v,4,4)-BIBDs

✍ Chen Kejun 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

All v(3, t)'s exist for 3t + 1 a prime

✍ G. H. J. Van Rees 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

The existence of a V(3, t ) , for any prime 3 t + l is proved constructively. A V(rn, t ) is equivalent to rn idempotent pairwise orthogonal Latin squares of order (rn+l)t + 1 with one hole of order t. 0 1995 John Wiley & Sons, he. ## 1. Introduction For the basic definitions about Latin squares t