Symmetric designs as the solution of an extremal problem in combinatorial set theory

DOI10.1016/S0195-6698(88)80043-XMaRDI QIDQ1108273zbMATH OpenOpenAlexFDO

Authors Robert Calderbank

Publication date 1988

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0195-6698(88)80043-x

zbMATH Keywords

adjacency matrixBose-Mesner algebraHahn polynomialJohnson schemesymmetric balanced incomplete block design

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Review text

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.

Recommendations

• Publication:3481715
• scientific article; zbMATH DE number 874487
• On the size of a blocking set in a symmetric design
• Number theoretic consequences on the parameters of a symmetric design
• scientific article; zbMATH DE number 1153453

Cites work

• Finite projective spaces and intersecting hypergraphs
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• scientific article; zbMATH DE number 3471925 (Why is no real title available?)
• scientific article; zbMATH DE number 3616474 (Why is no real title available?)
• scientific article; zbMATH DE number 3797651 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Maximum degree and fractional matchings in uniform hypergraphs

Cited in

(10)

• New proof of a theorem of Szekeres
• A characterization of the extensions of symmetric designs
• Bruck-Ryser abstract theorem and symmetric designs
• Intersecting designs from linear programming and graphs of diameter two
• Matchings and covers in hypergraphs
• An Erdős-Ko-Rado theorem for regular intersecting families of octads
• On a property of symmetric designs of order n\(\equiv 2(mod\,4)\)
• Ryser's conjecture for \(t\)-intersecting hypergraphs
• scientific article; zbMATH DE number 3116601 (Why is no real title available?)
• Separating subsets from their images

This page was built for publication: Symmetric designs as the solution of an extremal problem in combinatorial set theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108273)