197 search results - page 1 / 40 » On the Existence of Large Sets of t-designs of Prime Sizes |
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive ...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
DM
2006
13 years 4 months ago
2006
The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions ...
DM
2007
13 years 4 months ago
2007
We investigate the existence of 3-designs and uniform large sets of 3-designs with block size 6 admitting PSL(2, q) as an automorphism group. We show the existence of simple 3-(28...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...