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, January 26, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Marek Sulovský

On History of Tverberg Theorems[abstract]

Recent three months brought a major improvement in the bounds for the colored Tverberg theorems. In this talk, we will give an introduction to the Tverberg theorem and its colorful variants and at the end, we will summarize some of the latest improvements by the following authors: [1] Blagojevic, Matschke, Ziegler: Optimal bounds for the colored Tverberg problem (arXiv:0910.4987v2) [2] Blagojevic, Matschke, Ziegler: Optimal bounds for a colorful Tverberg-Vrecica type problem (arXiv:0911.2692v2) [3] Vrecica, Zivaljevic: Chessboard complexes indomitable (arXiv:0911.3512v1) (all three available on but yet to be published)

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