๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On Cyclically Resolvable Cyclic Steiner
โœ Clement Lam; Ying Miao ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB

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

Constructions for cyclic 3-designs and i
โœ Tao Feng; Yanxun Chang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 229 KB

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

Cyclically resolvable designs and triple
โœ I. Anderson; N. J. Finizio ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 552 KB

## 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.