Symmetric designs as the solution of an extremal problem in combinatorial set theory (Q1108273): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0195-6698(88)80043-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089254378 / rank
 
Normal rank

Latest revision as of 11:18, 30 July 2024

scientific article
Language Label Description Also known as
English
Symmetric designs as the solution of an extremal problem in combinatorial set theory
scientific article

    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
    0 references

    Identifiers