Time: 16:30-18:00

Location: Mondi 3

Speaker 1: Yiting Wang (Kwan group)

Title: The Littlewood-Offord problem

Abstract: Given a n-variate degree-d polynomial of independent Rademacher random variables, what is an upper bound for the probability it equals to any fixed value? This is known as the (polynomial) Littlewood-Offord problem. In this talk, I will first present a few classic results and their applications. Then, I will present our recent results, and if time permits, the proof sketches. This is based on a joint work with Zhihan Jin, Matthew Kwan and Lisa Sauermann.

Speaker 2:  Daniel Bedats (Wagner group)

Title: Back to kindergarten: colors, triangles, counting

Abstract: I will present two cornerstone results of convex geometry: colorful Carathéodory theorem and Tverberg theorem. In low-dimensional cases, they can be seen as innocent statements about colors and triangles - things we learn in kindergarten. However, they give rise to a fascinating array of open questions when counting - another preschool skill - enters the picture.