Skip to main content
Log in

Studying designs via multisets

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

Abstract

A new method to study families of finite sets, in particular t-designs, by studying families of multisets (also called lists) and their relationships with families of sets, is developed. Notion of the tag for a subset defined earlier by one of the authors is extended to a submultiset. A new concept t-(v, k, λ) list design is defined and studied. Basic existence theory for designs is extended to a new set up of list designs. In particular tags are used to prove that signed t-list designs exist whenever necessary conditions are satisfied. The concepts of homomorphisms and block spreading are extended to this new set up.

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.

Similar content being viewed by others

References

  1. Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1986)

    MATH  Google Scholar 

  2. Blanchard J.L.: A construction for Steiner 3-designs. J. Comb. Theory A 71, 60–67 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blanchard J.L.: A construction for orthogonal arrays with strength t ≥  3. Discret. Math. 137(1–3), 35–44 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blanchard J.L.: The existence of orthogonal arrays of any strength with large order, unpublished manuscript.

  5. Chahal J.S., Singhi N.M.: Tags on k-subsets and t-designs. J. Comb. Inf. Syst. Sci. 36, 33–51 (2001)

    MathSciNet  Google Scholar 

  6. Graham R.L., Li S.Y.R., Li W.W.: On the structure of the t-designs. SIAM J. Algebra Discret. Methods 1, 8–14 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  7. Graver J., Jurkat W.B.: The module structure of integral designs. J. Comb. Theory A 15, 75–90 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Mohácsy H., Ray-Chaudhuri D.K.: A construction for group divisible t-designs with strength t ≥  2n and index unity. J. Stat. Plan. Inference 109, 167–177 (2003)

    Article  MATH  Google Scholar 

  9. Mohácsy H., Mohácsy H., Mohácsy H.: Candelabra systems and designs. J. Stat. Plan. Inference 106, 419–448 (2002)

    Article  MATH  Google Scholar 

  10. Ray-Chaudhuri D.K., Singhi N.M.: The existence of t-designs with large v and λ. SIAM J. Discret. Math. 1, 98–104 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Singhi N.M.: Tags on subsets. Discret. Math. 306(14), 1610–1623 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wilson R.M.: The necessary conditions are sufficient for something. Util. Math. 4, 207–215 (1973)

    MATH  Google Scholar 

  13. Wilson R.M.: An existence theory for pairwise balanced designs III, proof of existence conjecture. J. Comb. Theory 18, 71–79 (1975)

    Article  MATH  Google Scholar 

  14. Wilson R.M.: A diagonal form for incidence matrices of t-subsets vs. k-subsets. Eur. J. Comb. 11, 601–615 (1990)

    Google Scholar 

  15. Wilson R.M.: Thoughts on spreading blocks, unpublished manuscript.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Navin Singhi.

Additional information

This is one of several papers published together in Designs, Codes and Cryptography on the special topic: “Combinatorics – A Special Issue Dedicated to the 65th Birthday of Richard Wilson”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Singhi, N., Ray-Chaudhuri, D.K. Studying designs via multisets. Des. Codes Cryptogr. 65, 365–381 (2012). https://doi.org/10.1007/s10623-012-9708-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9708-0

Keywords

Mathematics Subject Classification

Navigation