𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large sets of 3-designs from psl(2, q), with block sizes 4 and 5

✍ Scribed by C. A. Cusack; S. W. Graham; D. L. Kreher

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
568 KB
Volume
3
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We determine the distribution of 3−(q + 1,k,λ) designs, with k ϵ {4,5}, among the orbits of k‐element subsets under the action of PSL(2,q), for q ϵ 3 (mod 4), on the projective line. As a consequence, we give necessary and sufficient conditions for the existence of a uniformly‐PSL(2,q) large set of 3−(q + 1,k,λ) designs, with k ϵ {4,5} and q ≡ 3 (mod 4). © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

3-Designs of PSL(2, 2n) With block sizes
3-Designs of PSL(2, 2n) With block sizes 4 and 5
✍ M. S. Keranen; D. L. Kreher 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

## Abstract We determine the distribution of 3‐designs among the orbits of 4‐ and 5‐element subsets under the action of PSL(2,2^__n__^) on the projective line. Thus we give complete information on all Kramer–Mesner matrices for the action of PSL(2,2^__n__^) on 3‐sets versus 4‐ and 5‐sets. As a cons

Large sets of disjoint group-divisible d
Large sets of disjoint group-divisible designs with block size three and type 2n41
✍ H. Cao; J. Lei; L. Zhu 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^__n__^4^1^ have been studied by Schellenberg, Chen, Lindner and Stinson. These large sets have applications in cryptography in the construction of perfect threshold schemes. It is known that such large sets

Incomplete perfect mendelsohn designs wi
Incomplete perfect mendelsohn designs with block size 4 and holes of size 2 and 3
✍ F. E. Bennett; H. Shen; J. Yin 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 643 KB

## Abstract Let __v__, __k__, and __n__ be positive integers. An incomplete perfect Mendelsohn design, denoted by __k__‐IPMD(__v__, __n__), is a triple (__X, Y__, 𝔹) where __X__ is a __v__‐set (of points), __Y__ is an __n__‐subset of __X__, and 𝔹 is a collection of cyclically ordered __k__‐subsets

Existence of large sets of disjoint grou
Existence of large sets of disjoint group-divisible designs with block size three and type 2n41
✍ L. Ji 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^__n__^4^1^ (denoted by __LS__ (2^__n__^4^1^)) were first studied by Schellenberg and Stinson and motivated by their connection with perfect threshold schemes. It is known that such large sets can exist only

Further results on large sets of disjoin
Further results on large sets of disjoint group-divisible designs with block size three and type 2n41
✍ H. Cao; J. Lei; L. Zhu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^n^4^1^ were first studied by Schellenberg and Stinson because of their connection with perfect threshold schemes. It is known that such large sets can exist only for __n__ ≡0 (mod 3) and do exist for all odd