In this article, we present a direct construction for cyclically resolvable cyclic Steiner 2-designs which is applicable irrespective of the parity of the block size. As an example, by using Weil's theorem on character sums, this construction gives an infinite series of cyclically resolvable cyclic
Cyclic resolvability of cyclic Steiner 2-designs
โ Scribed by Masaki Genma; Miwako Mishima; Masakazu Jimbo
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 163 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
In this article, direct and recursive constructions for a cyclically resolvable cyclic Steiner 2-design are given.
๐ SIMILAR VOLUMES
This paper gives some recursive constructions for cyclic 3-designs. Using these constructions we improve Grannell and Griggs's construction for cyclic Steiner quadruple systems, and many known recursive constructions for cyclic Steiner quadruple systems are unified. Finally, some new infinite famili
## We construct cyclically resolvable (v, 4 , l ) designs and cyclic triple whist tournaments Twh(v) for all v of the form 3pt'. . .p> + 1, where the pi are primes 3 1 (mod 4), such that each p1 -1 is divisible by the same power of 2.