On the number of mutually disjoint cyclic designs and large sets of designs (Q5935433)

The authors found out \(N(t,v,k,\lambda)\) which is the maximum possible number of mutually disjoint cyclic \(t\)-\((v,k,\lambda)\) designs for two sets of parameters, giving bounds for other sets of parameters. In the case of large sets of designs, they discuss optimization techniques for finding mutually disjoint cyclic designs and extend results in the smaller cases. Two new large sets of designs are described in the end of the paper. Examples of results are: \(N(2,13,6,5)= 9\) ; \(N(2,13,5,5)= 23\); the number \(N(2,19,4,2)\) belongs to the interval \([29,35]\).