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, October 14, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Gabriel Katz

Tropical Centerpoints and Tverberg Points

In tropical geometry, the focus of study is the tropical semiring (\mathbb{R}, \min, +) and its semimodule \mathbb{R}^d. Notions of convexity, hyperplanes and halfspaces exist for this semimodule, but these behave differently than their classical counterparts. For instance, a tropical hyperplane splits \mathbb{R}^d into d parts.

In this talk we will look at two classical theorems, the centerpoint Theorem and Tverberg's Theorem. For both of them, we will derive a tropical equivalent. Further, for n>d, we will present an O(n^4) algorithm for finding a point that is both a tropical centerpoint and a tropical Tverberg point. In higher dimensions, this is better than in the classical setting, where the best known exact algorithms are exponential in d.

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