Top

Designs, Codes and Cryptography

Published in:

07-12-2016

Large sets of Kirkman triple systems of prime power sizes

Authors: Hao Zheng, Yanxun Chang, Junling Zhou

Published in: Designs, Codes and Cryptography | Issue 3/2017

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

previous article The graph of minimal distances of bent functions and its properties

next article On symmetric BIBDs with the same 3-concurrence

Available only for authorised users

Chang Y., Ge G.: Some new large sets of KTS\((v)\). Ars Comb. 51, 306–312 (1999).MathSciNetMATH

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

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

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

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

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

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

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

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).MathSciNetCrossRefMATH

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).MathSciNetCrossRefMATH

14.

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

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).MathSciNetCrossRefMATH

Title: Large sets of Kirkman triple systems of prime power sizes
Authors: Hao Zheng
Yanxun Chang
Junling Zhou
Publication date: 07-12-2016
Publisher: Springer US
Published in: Designs, Codes and Cryptography / Issue 3/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0315-3

Springer Professional

Large sets of Kirkman triple systems of prime power sizes

Abstract

Premium Partner

Springer Professional

Abstract

Please log in to get access to your license.

Other articles of this Issue 3/2017

Nonexistence of two classes of generalized bent functions

Covering arrays from m-sequences and character sums

There is exactly one -cyclic 1-perfect code

On symmetric BIBDs with the same 3-concurrence

New bounds of permutation codes under Hamming metric and Kendall’s -metric

On equivalence of negaperiodic Golay pairs

Premium Partner