Ben Gillott

Cambridge


Intersection problems and Concentration-of-Measure


Combinatorics Seminar


13th October 2026, 11:00 am – 12:00 pm
Fry Building, 2.04


We prove non-trivial upper bounds for some intersection problems. We achieve this by proving a generalisation of the concentration-of-measure phenomenon in $\{0,1\}^n$.






Comments are closed.
css.php