Symmetric designs as the solution of an extremal problem in combinatorial set theory (Q1108273)
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: Symmetric designs as the solution of an extremal problem in combinatorial set theory |
scientific article; zbMATH DE number 4066898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symmetric designs as the solution of an extremal problem in combinatorial set theory |
scientific article; zbMATH DE number 4066898 |
Statements
Symmetric designs as the solution of an extremal problem in combinatorial set theory (English)
0 references
1988
0 references
A proof is given for the result that \(\nu <(k^2-k+\lambda)/\lambda\) for an equi-replicated, equi-set sized design in \(\nu\) symbols and set size \(k\), where any two sets intersect in at least \(\lambda\) symbols. The equality is attained for a symmetric balanced incomplete block design.
0 references
Johnson scheme
0 references
Bose-Mesner algebra
0 references
adjacency matrix
0 references
Hahn polynomial
0 references
symmetric balanced incomplete block design
0 references
