Partitioning sets of quadruples into designs. I (Q1263589)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning sets of quadruples into designs. I |
scientific article; zbMATH DE number 4127208
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning sets of quadruples into designs. I |
scientific article; zbMATH DE number 4127208 |
Statements
Partitioning sets of quadruples into designs. I (English)
0 references
1989
0 references
The authors determine that there are exactly 26 nonisomorphic ways to partition the set of all quadruples chosen from an 8-set into five disjoint 2-(8,4,3) designs (a large set of 2-(8,4,3) designs).
0 references
partition
0 references
quadruples
0 references
designs
0 references
