{c}

<Richard M. Wilson> studies <combinatorial design theory>. His joint paper with <Dijen K. Ray-Chaudhuri> develops inequalities for designs and uniform set families.<On t-designs by Dijen K. Ray-Chaudhuri and Richard M. Wilson>[Original author byline and abstract]{ref}

The <Ray-Chaudhuri–Wilson theorem> makes restricted intersection sizes impose an upper bound on the number of blocks. Associate a polynomial to each block, prove the resulting functions are <linearly independent>, and bound their number by the dimension of the ambient space. The method exemplifies the use of <linear algebra> in extremal combinatorics.<On t-designs by Dijen K. Ray-Chaudhuri and Richard M. Wilson>[Theorem 3]{ref}

\Image[https://divisions-prod-assets.resources.caltech.edu/pma24/images/Wilson_Richard_415.width-350.41e07591.fill-310x310-c100.jpg]
{title=Richard M. Wilson}
{description=Portrait identified by the linked primary author or institutional profile.}
{source=https://www.pma.caltech.edu/people/richard-m-wilson}
{width=220}


 Richard M. Wilson (source code)