Intersection Patterns and Tverberg type theorems

Abstract: One of the most beautiful and classic theorems in Discrete Geometry is Tverberg’s theorem, which says that any set with sufficiently many points in $R^d$ can always be partitioned into m parts so that their convex hulls intersect. In this talk we will give some generalizations of this theorem that are related to some interesting computing and graph theory problems as well as some cool applications.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456