✦ LIBER ✦

A few more large sets of t-designs

✍ Scribed by Yeow Meng Chee; Spyros S. Magliveras

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 176 KB
Volume: 6
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1998)6:4<293::aid-jcd7>3.0.co;2-a

No coin nor oath required. For personal study only.

✦ Synopsis

We construct several new large sets of t-designs that are invariant under Frobenius groups, and discuss their consequences. These large sets give rise to further new large sets by means of known recursive constructions including an infinite family of large sets of 3 -(v, 4, λ) designs.

📜 SIMILAR VOLUMES

New large sets of t-designs

✍ Reinhard Laue; Spyros S. Magliveras; Alfred Wassermann 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

Some Infinite Families of Large Sets of

Some Infinite Families of Large Sets of t-Designs

✍ B. Tayfeh-Rezaie 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 98 KB

A set of necessary conditions for the existence of a large set of t-designs, LS[N] (t, k, v), is N |( v&i k&i ) for i=0, 1, ..., t. We show that these conditions are sufficient for N=3, t=2, 3, or 4, and k 8.

Some results on the existence of large s

Some results on the existence of large sets of t-designs

✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi

New large sets of t-designs with prescri

New large sets of t-designs with prescribed groups of automorphisms

✍ R. Laue; G. R. Omidi; B. Tayfeh-Rezaie; A. Wassermann 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 1 views

## Abstract In this article, we investigate the existence of large sets of 3‐designs of prime sizes with prescribed groups of automorphisms PSL(2,__q__) and PGL(2,__q__) for __q__ < 60. We also construct some new interesting large sets by the use of the computer program DISCRETA. The results obtain

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

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