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: Thursday, October 02, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jean Cardinal (Université Libre de Bruxelles)

General Position Subsets in d-space

In the sixties, Erdős posed the problem of finding a lower bound on the largest number of points in general position among any set of points in the plane with no four on a line. We consider variants of this question for d-dimensional point sets and generalize previously known bounds. In particular, we prove that every set of C(q^d)log q points in d-space, for some absolute constant C>0, contains q cohyperplanar points or q points in general position. This is a joint work with Csaba Tóth and David Wood.

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