New t-designs found by basis reduction

Show full item record

Title: New t-designs found by basis reduction
Author: Kreher, Donald; Radziszowski, Stanislaw
Abstract: 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.
Record URI: http://hdl.handle.net/1850/8772
Date: 1987

Files in this item

Files Size Format View
SRadziszowskiArticle12-1987.pdf 967.9Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse