An affine ฮฑ-resolvable PBD of index ฮป is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in ฮป blocks, (ii) any point occurs in ฮฑ blocks of each
On the dimension of affine resolvable designs and hypercubes
โ Scribed by Charles F. Laywine
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 737 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In this article, we settle a problem which originated in 4 regarding the existence of resolvable (__K__~4~โโโ__e__)โdesign. We solve the problem with two possible exceptions. ยฉ 2007 Wiley Periodicals, Inc. J Combin Designs 15: 502โ510, 2007
## Abstract It is wellโknown that the number of designs with the parameters of a classical design having as blocks the hyperplanes in __PG__(__n, q__) or __AG__(__n, q__), __n__โฅ3, grows exponentially. This result was extended recently [D. Jungnickel, V. D. Tonchev, Des Codes Cryptogr, published on
An a-resolvable BIBD is a BIBD with the property that the blocks can be partitioned into disjoint classes such that every class contains each point of the design exactly times. In this paper, we show that the necessary conditions for the existence of -resolvable designs with block size four are sufยฎ