2-(22, 8, 4) Designs have no blocks of type 3

Show simple item record

dc.contributor.author McKay, Brendan
dc.contributor.author Radziszowski, Stanislaw
dc.date.accessioned 2009-01-13T18:15:41Z
dc.date.available 2009-01-13T18:15:41Z
dc.date.issued 1999
dc.identifier.citation The Journal of Combinatorial Mathematics and Combinatorial Computing 30 (1999) 251-253
dc.identifier.issn 0835-3026
dc.identifier.uri http://hdl.handle.net/1850/8002
dc.description.abstract Using computer algorithms we show that in any 2-(22,8,4) design there are no blocks of type 3, thus leaving as possible only types 1 and 2. Blocks of type 3, i.e. those which intersect two others in one point, are eliminated using the algorithms described in our previous paper. It was perhaps the second largest computation ever performed (after the solution to the RSA129 challenge), requiring more than a century of cpu time.
dc.language.iso en_US
dc.publisher The Charles Babbage Research Centre: The Journal of Combinatorial Mathematics and Combinatorial Computing
dc.relation.ispartofseries vol. 30
dc.relation.ispartofseries pps. 251-253
dc.title 2-(22, 8, 4) Designs have no blocks of type 3
dc.type Article

Files in this item

Files Size Format View
SRadziszowskiArticle1999.pdf 89.13Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse