𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by G. B. Khosrovshahi; R. Tayfeh-Rezaie


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
96 KB
Volume
11
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A set of trivial necessary conditions for the existence of a large set of t‐designs, LSN, 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 conditions are sufficient in the cases N = 2 and 3, respectively. Ajoodani‐Namini has established the truth of Hartman's conjecture for t = 2. Apart from this celebrated result, we know the correctness of the conjectures for a few small values of k, when N = 2 and t ≀ 6, and also when N = 3 and t ≀ 4. In this article, we show that similar results can be obtained for infinitely many values of k. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 144–151, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10027


πŸ“œ SIMILAR VOLUMES


Some Infinite Families of Large Sets of
✍ 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.

New large sets of t-designs
✍ Reinhard Laue; Spyros S. Magliveras; Alfred Wassermann πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 170 KB
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.

New large sets of t-designs with prescri
✍ 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

Existence of large sets of disjoint grou
✍ 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
✍ 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