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, November 15, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Lorenz Klaus

k-Sets in Three Dimensions

Given a finite set P of points in the d-dimensional Euclidean space, a k-set of P is a subset Q of P of size k, such that Q can be linearly separated from the remaining points of P. There has been a lot of effort among many researchers to give good upper and lower bounds on the maximum number of k-sets but the question is still widely open even in low dimensions (2 - 4). The paper presents the currently best upper bound of O(nk^(3/2)) on the maximum number of k-sets of n points in 3 dimensions.

Paper by M. Sharir, S. Smorodinsky, G. Tardos, An Improved Bound for k-Sets in Three Dimensions, Discrete Comput. Geom. 26 (2001), 195-204.

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