During this talk we will discuss how one can obtain Tverberg partitions using the probabilistic method. In other words, one aims at splitting a set of points in R^d into a fixed number of parts so that the convex hull of the parts intersect, and we want to see if random partitions can give meaningful results. We will highlight the applications to the colorful versions of Tverberg's theorem, where additional combinatorial conditions are imposed on the desired partition.
Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.
The ACO Seminar (2018–2019)