Skip to main content
Log in

On existence theorems for simple t-designs

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

Abstract

The paper concerns a study of our previous general construction for simple t-designs, called the basic construction, with the goal to establish existence theorems for t-designs. As a general framework the basic construction involves a great deal of possibilities of combining ingredient designs, and thus computations are necessary for constructing designs by this method. The work shows the results of an investigation finding specified conditions under which the required computations can be avoidable. They thus lead to existence theorems for simple t-designs and many of them have been found. Also a large number of examples are included to illustrate the results.

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. Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge Univ. Press, Cambridge (1999).

    Book  MATH  Google Scholar 

  2. Colbourn C.J., Dinitz J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007).

    MATH  Google Scholar 

  3. Stinson D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2003).

    MATH  Google Scholar 

  4. van Trung T.: On the construction of \(t\)-designs and the existence of some new infinite families of simple \(5\)-designs. Arch. Math. 47, 187–192 (1986).

    Article  MathSciNet  MATH  Google Scholar 

  5. van Trung T.: Simple \(t\)-designs: a recursive construction for arbitrary \(t\). Des. Codes Cryptogr. 83, 493–502 (2017). https://doi.org/10.1007/s10623-016-0238-z.

    Article  MathSciNet  MATH  Google Scholar 

  6. van Trung T.: A recursive construction for simple \(t\)-designs using resolutions. Des. Codes Cryptogr. 86, 1185–1200 (2018). https://doi.org/10.1007/s10623-017-0389-6.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tran van Trung.

Additional information

Communicated by L. Teirlinck.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

van Trung, T. On existence theorems for simple t-designs. Des. Codes Cryptogr. 87, 1521–1540 (2019). https://doi.org/10.1007/s10623-018-0550-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-018-0550-x

Keywords

Mathematics Subject Classification

Navigation