At the Seventeenth Southeastern International Conference on Combinatorics, Graph Theory and Computing we presented a new algorithm for finding t-(v,k,?) designs without repeated blocks. The central idea of the algorithm was basis reduction. This year we report on the success we have had using it. Namely, the construction of several new simple t-designs including a 4-(12,6,10) design, a 6-(14,7,4) design and 5-(28,6,?) designs for each admissible ?, ? != 1 (or 22). See article for exact formulas.
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
D. Kreher and S. Radziszowski. New t-designs found by basis reduction Congressus Numerantium Vol. 59 (1987) 155-164.
RIT – Main Campus