Abstract
A Steiner 2-design is said to be G-invariantly resolvable if admits an automorphism group G and a resolution invariant under G. Introducing and studying resolvable difference families, we characterize the class of G-invariantly resolvable Steiner 2-designs arising from relative difference families over G. Such designs have been already studied by Genma, Jimbo, and Mishima [13] in the case in which G is cyclic. Developping their results, we prove that any (p, k, 1)-DF (p prime) whose base blocks exactly cover p−1/k(k−1) distinct cosets of the k-th roots of unity (mod p), leads to a Ckp-invariantly resolvable cyclic (kp,k,1)-BBD. This induced us to propose several constructions for DF's having this property. In such a way we prove, in particular, the existence of a C5p-invariantly resolvable cyclic (5p, 5, 1)-BBD for each prime p = 20n + 1 < 1.000.
Similar content being viewed by others
References
I. Anderson and N. J. Finizio, Cyclically resolvable designs and triple whist tournaments, J. of Combin. Des., Vol. 1 (1993) pp. 347–358.
T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press, Cambridge (1993).
M. Buratti, Improving two theorems of Bose on difference families, J. of Combin Designs, Vol. 3 (1995) pp. 15–24.
M. Buratti, On simple radical difference families, J. of Combin. Designs, Vol. 3 (1995) pp. 161–168.
M. Buratti, Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5, Discrete Math., Vol. 138 (1995) pp. 169–175.
M. Buratti, A powerful method for constructing difference families and optimal optical orthogonal codes, Designs, Codes and Cryptography, Vol. 5 (1995) pp. 13–25.
M. Buratti, A packing problem and its application to Bose's families, J. of Combin. Designs, Vol. 4 (1996) pp. 457–472.
M. Buratti, Recursive constructions for difference matrices and relative difference families, preprint (1995).
M. Buratti, From a (G, k, 10 to a (C k ⊕ G, k, 1) difference family, to appear in Designs, Codes and Cryptography.
M. Buratti, Packing the blocks of a regular structure, to appear in Bull. Ist. Comb. Appl.
M. J. Colbourn and C. J. Colburn, Recursive constructions for cyclic block designs, J. Statist. Plann. Infer., Vol. 10 (1984) pp. 97–103.
M. J. Colbourn and R. Mathon, On cyclic Steiner 2-designs, Ann. Discrete Math., Vol. 7 (1980) pp. 215–253.
M. Genma, M. Jimbo and M. Mishima, Cyclic resolvability of cyclic Steiner 2-designs, preprint (1995).
M. Greig, Some balanced incomplete block design constructions, Congr. Numer., Vol. 77 (1990) pp. 121–134.
M. Jimbo, Recursive constructions for cyclic BIB designs and their generalizations, Discrete Math., Vol. 116 (1993) pp. 79–95.
M. Jimbo and S. A. Vanstone, Recursive constructions for resolvable and doubly resolvable 1-rotational Steiner 2-designs, Utilitas Math., Vol. 26 (1984) pp. 46–61.
D. K. Ray-Chauduri and R. M. Wilson, The existence of resolvable designs, A Survey of Combinatorial Theory, North Holland, Amsterdam (1973) pp. 361–375.
R. M. Wilson, Cyclotomy and difference families in elementary Abelian groups, J. Number Theory, Vol. 4 (1972) pp. 17–47.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buratti, M. On Resolvable Difference Families. Designs, Codes and Cryptography 11, 11–23 (1997). https://doi.org/10.1023/A:1008298724568
Issue Date:
DOI: https://doi.org/10.1023/A:1008298724568