Richard M. Wilson studies combinatorial design theory. His joint paper with Dijen K. Ray-Chaudhuri develops inequalities for designs and uniform set families.[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.[ref]
New to topics? Read the docs here!