Skip to main content
Log in

Large sets of Kirkman triple systems of prime power sizes

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

Abstract

Research on the existence of large sets of Kirkman triple systems (LKTS) extends from the mid-eighteen hundreds to the present. Enlightened by known direct constructions of LKTSs, we bring forth new approaches and finally establish the existence of LKTSs of all admissible prime power sizes less than 400 only with two possible exceptions. In the process, we also employ known construction methods and draw support from efficient algorithms.

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. Chang Y., Ge G.: Some new large sets of KTS\((v)\). Ars Comb. 51, 306–312 (1999).

    MathSciNet  MATH  Google Scholar 

  2. Chang Y., Zhou J.: Large sets of Kirkman triple systems and related designs. J. Comb. Theory (A) 120, 649–670 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  3. Denniston R.H.F.: Sylvester’s problem of the 15 schoolgirls. Discret. Math. 9, 229–233 (1974).

  4. Denniston R.H.F.: Four double resolvable complete three-designs. Ars Comb. 7, 265–272 (1979).

    MATH  Google Scholar 

  5. Ge G.: More large sets of KTS\((v)\). J. Comb. Math. Comb. Comput. 49, 211–214 (2004).

    MathSciNet  MATH  Google Scholar 

  6. Ji L.: A construction for large sets of disjoint Kirkman triple systems. Des. Codes Cryptogr. 43, 115–122 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  7. Ji L., Lei L.: Further results on large sets of Kirkman triple systems. Discret. Math. 308, 4643–4652 (2008).

  8. Kirkman T.P.: Note on an unanswered prize question. Camb. Dublin Math. J. 5, 255–262 (1850).

    Google Scholar 

  9. Lei J.: On large sets of disjoint Kirkman triple systems. Discret. Math. 257, 63–81 (2002).

  10. Lei J.: On large sets of Kirkman triple systems and \(3\)-wise balanced design. Discret. Math. 279, 345–354 (2004).

  11. Ray-Chaudhuri D.K., Wilson R.M.: Solution of Kirkman’s schoolgirl problem. Proc. Symp. Pure Math. 19, 187–204 (1971).

    Article  MathSciNet  MATH  Google Scholar 

  12. Schreiber S., quoted by Hanani H.: Resolvable designs, Colloquio Internazionale Sulle Teorie Combinatorie (Atti dei Convegni Lincei), Rome, Tomo II 17, 249–252 (1976) .

  13. Yuan L., Kang Q.: Some infinite families of large sets of Kirkman triple systems. J. Comb. Designs 16, 202–212 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  14. Yuan L., Kang Q.: Another construction for large sets of Kirkman triple systems. Des. Codes Cryptogr. 48, 35–42 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhang S., Zhu L.: Transitive resolvable idempotent symmetric quasigroups and large sets of Kirkman triple systems. Discret. Math. 247, 215–223 (2002).

  16. Zhang S., Zhu L.: An improved product construction for large sets of Kirkman triple systems. Discret. Math. 260, 307–313 (2003).

  17. Zheng H., Chang Y., Zhou J.: Direct constructions of large sets of Kirkman triple systems. Des. Codes Cryptogr. (2016). doi:10.1007/s10623-016-0197-4.

  18. Zhou J., Chang Y.: New results on large sets of Kirkman triple systems. Des. Codes Cryptogr. 55, 1–7 (2010).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Supported by NSFC Grants 11431003 and 11571034.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Junling Zhou.

Additional information

Communicated by D. Jungnickel.

Appendices

Appendix 1

We list all the base blocks of \((q-1,3,\{2,3\},1)\) difference families over \(\mathbb {Z}_{q-1}\) in Lemma 3.1 meeting all the conditions of Theorem 2.2. We also give a primitive element \(\xi \) in use or its primitive polynomial f(x). Note that in each base block set the two pairs \(\{0,\alpha \}\), \(\{\beta ,\beta +{q-1\over 2}\}\) are listed in order; they give rise to three blocks \(\{\infty _1,1,\xi ^{\alpha }\}\), \(\{\infty _2,-1,-\xi ^{\alpha }\}\), and \(\{0,\xi ^\beta ,-\xi ^\beta \}\) as in the proof of Theorem 2.2.

\((1)\ q=121, f(x)=x^2 + 7x + 2\)

figure a

\((2)\ q=193,\xi =5\)

figure b

\((3)\ q=289, f(x)=x^2 + 16x + 3\)

figure c

\((4)\ q=337, \xi =10\)

figure d

Appendix 2

We list two starter parallel classes in the proof of Lemma 3.2 meeting all the conditions in Lemma 2.3.

\((1)\ q=109, \xi =6\)

figure e

\((2)\ q=157, \xi =5\)

figure f

\((3)\ q=181, \xi =2\)

figure g

\((4)\ q=229, \xi =6\)

figure h

\((5)\ q=277, \xi =5\)

figure i

Appendix 3

We list all the base blocks of \((378,3,\{2,3\},2)\) disjoint difference family over \(\mathbb {Z}_{378}\) relative to \(H=\{0,126,252\}\) in Lemma 3.3. Take \( q=379\) and \(\xi =2\) in Lemma 3.3 to check the property (3) of Lemma 2.4. Note that in the base block set the three pairs \(\{x_i,y_i\}\) \((i=1,2,3)\) are listed in order; they give rise to three blocks \(\{\infty _1,\xi ^{x_1},\xi ^{y_1}\},\) \(\{\infty _2,\xi ^{x_2},\xi ^{y_2}\}\) and \(\{0,\xi ^{x_3},\xi ^{y_3}\}\), as in the proof of [17, Theorem 3.2].

figure j

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zheng, H., Chang, Y. & Zhou, J. Large sets of Kirkman triple systems of prime power sizes. Des. Codes Cryptogr. 85, 411–423 (2017). https://doi.org/10.1007/s10623-016-0315-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-016-0315-3

Keywords

Mathematics Subject Classification

Navigation