Constructions of Spherical 3-Designs
✍ Scribed by Béla Bajnok
- Publisher
- Springer Japan
- Year
- 1998
- Tongue
- English
- Weight
- 178 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let v and k be positive integers. A (v, k, 1)-packing design is an ordered pair (V, B B B) where V is a v-set and B B B is a collection of k-subsets of V (called blocks) such that every 2-subset of V occurs in at most one block of B B B. The packing problem is mainly to determine the packing number
A method of construction of certain balanced incomplete block (BIB) designs is defined from which we get new series of BIB designs. ## 1 . Introduction For a BIB design with parameters v, b, r , k, I if the blocks can be separated into t
## A construction is given for a (pzO(p+ 1),p2,pZnf'(p+ l),~?"+',p~~(p+ 1)) (p a prime) divisible difference set in the group H x 2, \*a+ I where His any abelian group of order pf 1. This can be used to generate a symmetric semi-regular divisible design; this is a new set of parameters for A, #O,
of perfect Mendelsohn designs, Discrete Mathematics 103 (1992) 139-151. Let n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, %) where V is the vertex set of D,, the complete directed graph on n vertices, and '%' is a set of directed cycles (called blocks) of lengt