Block intersection polynomials

Peter J. Cameron, Leonard H. Soicher

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


We introduce the block intersection polynomial, which is constructed using certain information about a block design with respect to a subset S of its point-set, and then provides further information about the number of blocks intersecting S in exactly i points, for i = 0, ⋯ , |S|.We also discuss some applications of block intersection polynomials, including bounding the multiplicity of a block in a t-(v, k, λ) design and in a resolvable t-(v, k, λ) design.

Original languageEnglish
Pages (from-to)559-564
Number of pages6
JournalBulletin of the London Mathematical Society
Issue number4
Publication statusPublished - 1 Jan 2007


Dive into the research topics of 'Block intersection polynomials'. Together they form a unique fingerprint.

Cite this