Enumeration of all simple t-(t+7,t+1,2) designs

Show full item record

Title: Enumeration of all simple t-(t+7,t+1,2) designs
Author: Radziszowski, Stanislaw
Abstract: We enumerate by computer algorithms all simple t (t +7, t +1, 2) designs for 1 <= t <= 5, i.e. for all possible t , and this enumeration is new for t >= 3. The number of nonisomorphic designs is equal to 3, 13, 27, 1 and 1 for t = 1, 2, 3, 4 and 5, respectively. We also present some properties of these designs including orders of their full automorphism groups and resolvability.
Record URI: http://hdl.handle.net/1850/8005
Date: 1992

Files in this item

Files Size Format View
SRadziszowskiArticle1992.pdf 73.81Kb 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