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-
Extending symmetric designs
โ Scribed by P.J Cameron
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 256 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
For q, an odd prime power, we construct symmetric 2q 2 2q 1Y q 2 Y 1 2 qq ร 1 designs having an automorphism group of order q that ยฎxes 2q 1 points. The construction indicates that for each q the number of such designs that are pairwise non-isomorphic is very large.
We introduce the study of designs in a coset of a binary code which can be held by vectors of a fixed weight. If C is a binary [2n, n, d] code with n odd and the words of weights n -1 and n + 1 hold complementary t-designs, then we show that the vectors of weight n in a coset of weight 1 also hold a
An embedding theorem for certain quasi-residual designs is proved and is used to construct a series of symmetric designs with v = (1 + 16 + ... + 16")9 + 16 "+~, k =(1 + 16 + ... + 16m)9, and 2 = (1 + 16 + ... + 16m-~)9 + 16".3, for a non-negative integer m.