Perfect Mendelsohn packing designs with block size five (Q1379655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1121315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect Mendelsohn packing designs with block size five |
scientific article; zbMATH DE number 1121315 |
Statements
Perfect Mendelsohn packing designs with block size five (English)
0 references
19 April 1999
0 references
\(P(v,k,1)\) is the maximum number of cyclically ordered \(k\)-subsets from a set of \(v\) elements such that every ordered pair of elements occurs \(t\) units apart in at most one of the subsets, where \(t\) range from \(1\) to \(k-1\). The authors treat the case \(k=5\) and obtain results for all \(v\), with a small number of exceptions.
0 references
packing designs
0 references
block size
0 references
0.8653080463409424
0 references
0.8270358443260193
0 references
0.8223271369934082
0 references
