Dijen K. Ray-Chaudhuri 2026-11-05
Dijen K. Ray-Chaudhuri works on combinatorial design theory. With Richard M. Wilson, he proved bounds linking design parameters and the permitted intersection sizes of blocks.[ref]
On t-designs by Dijen K. Ray-Chaudhuri and Richard M. Wilson. Original byline and introduction
The Ray-Chaudhuri–Wilson theorem bounds a uniform family of subsets when distinct members have only a limited number of intersection sizes. The proof encodes those restrictions in polynomials and uses linear independence to compare the family size with a finite-dimensional function space. Algebra thereby constrains a purely combinatorial configuration.[ref]
Richard M. Wilson 2026-11-05
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]
