Consider a degree-d polynomial f(ξ1, . . . , ξn) of independent Bernoulli random variables. What can be said about the concentration of f on any single value? This generalises the classical Littlewood–Offord problem, which asks the same question for linear polynomials. In this talk we discuss a few recent results in this area, focusing on combinatorial aspects.
This is joint work with Jacob Fox and Lisa Sauermann.