Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 04, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Patrick Schnider

Tverberg's Theorem for Hyperplanes

Tverberg's theorem is a fundamental theorem in discrete geometry which implies many other famous results such as Radons lemma and the Centerpoint theorem. It states that any r(d-1)+1 points in d-dimensional Euclidean space can be partitioned into r parts whose convex hulls have a common intersection. Motivated by an application in statistics, Rousseeuw and Hubert conjectured in 1999 that an analogue statement should be true when replacing "points" with "hyperplanes" and "convex hull" with "positive regression depth" (which will be defined in the talk). I will outline the motivation of the conjecture of Rousseeuw and Hubert by introducing combinatorial depth measures for hyperplane arrangements and show that the conjecture is true. This is joint work with Pablo Soberon.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login