Seminars & Colloquia Calendar
Ramsey graphs and anti-concentration
Matthew Kwan, Stanford
Location: Via zoom
Date & time: Friday, 11 December 2020 at 2:00PM - 3:00PM
Abstract: Anti-concentration inequalities provide limits on the extent to which random variables can be concentrated: for example, they commonly give uniform upper bounds on the probability that a random variable takes a particular value. In this talk I'll discuss some of the many connections between anti-concentration and combinatorics, initially focusing on applications to Ramsey graphs but also touching on a few other topics such as the polynomial Littlewood-Offord problem and permanents of random matrices.
These talks are for the local Rutgers Math Community only, Zoom links will be sent by the Department Chair via email.