Partitioning sets of quadruples into designs. I (Q1263589): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3770548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3784080 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880857 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3663313 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5836513 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4735197 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216658 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(89)90368-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4213358565 / rank | |||
Normal rank |
Latest revision as of 10:36, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitioning sets of quadruples into designs. I |
scientific article |
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