✦ LIBER ✦

New large sets of t-designs

✍ Scribed by Reinhard Laue; Spyros S. Magliveras; Alfred Wassermann

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 170 KB
Volume: 9
Category: Article
ISSN: 1063-8539
DOI: 10.1002/1520-6610(2001)9:1<40::aid-jcd4>3.0.co;2-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A few more large sets of t-designs

✍ Yeow Meng Chee; Spyros S. Magliveras 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

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.

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.

Extending Large Sets oft-Designs

✍ S. Ajoodani-Namini 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 278 KB

A large set of disjoint S(\*; t, k, v) designs, denoted by LS(\*; t, k, v), is a partition of k-subsets of a v-set into S(\*; t, k, v) designs. In this paper, we develop some recursive methods to construct large sets of t-designs. As an application, we construct infinite families of large sets of t-

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 coverings of t-sets with (t + 1)-set

New coverings of t-sets with (t + 1)-sets

✍ Kari J. Nurmela; Patric R. J. Östergård 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 434 KB 👁 1 views

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predeterm