Skip to main content
Log in

On Resolvable Difference Families

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Anderson and N. J. Finizio, Cyclically resolvable designs and triple whist tournaments, J. of Combin. Des., Vol. 1 (1993) pp. 347–358.

    Google Scholar 

  2. T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press, Cambridge (1993).

    Google Scholar 

  3. M. Buratti, Improving two theorems of Bose on difference families, J. of Combin Designs, Vol. 3 (1995) pp. 15–24.

    Google Scholar 

  4. M. Buratti, On simple radical difference families, J. of Combin. Designs, Vol. 3 (1995) pp. 161–168.

    Google Scholar 

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

    Google Scholar 

  6. M. Buratti, A powerful method for constructing difference families and optimal optical orthogonal codes, Designs, Codes and Cryptography, Vol. 5 (1995) pp. 13–25.

    Google Scholar 

  7. M. Buratti, A packing problem and its application to Bose's families, J. of Combin. Designs, Vol. 4 (1996) pp. 457–472.

    Google Scholar 

  8. M. Buratti, Recursive constructions for difference matrices and relative difference families, preprint (1995).

  9. M. Buratti, From a (G, k, 10 to a (C k G, k, 1) difference family, to appear in Designs, Codes and Cryptography.

  10. M. Buratti, Packing the blocks of a regular structure, to appear in Bull. Ist. Comb. Appl.

  11. M. J. Colbourn and C. J. Colburn, Recursive constructions for cyclic block designs, J. Statist. Plann. Infer., Vol. 10 (1984) pp. 97–103.

    Google Scholar 

  12. M. J. Colbourn and R. Mathon, On cyclic Steiner 2-designs, Ann. Discrete Math., Vol. 7 (1980) pp. 215–253.

    Google Scholar 

  13. M. Genma, M. Jimbo and M. Mishima, Cyclic resolvability of cyclic Steiner 2-designs, preprint (1995).

  14. M. Greig, Some balanced incomplete block design constructions, Congr. Numer., Vol. 77 (1990) pp. 121–134.

    Google Scholar 

  15. M. Jimbo, Recursive constructions for cyclic BIB designs and their generalizations, Discrete Math., Vol. 116 (1993) pp. 79–95.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  18. R. M. Wilson, Cyclotomy and difference families in elementary Abelian groups, J. Number Theory, Vol. 4 (1972) pp. 17–47.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008298724568

Navigation