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

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Jiří Matoušek (Charles Univ., Prague)

Blocking visibility for points in general position

This talk concerns a problem I posed at GWOP 2007. For a finite set P in the plane, let b(P) be the smallest possible size of a set Q disjoint from P and such that every segment with both endpoints in P contains at least one point of Q. We consider the problem of estimating b(n), the minimum of b(P) over all n-point sets P in the plane with no three points collinear. By imitating Behrend's construction of sparse sets of integers avoiding 3-term arithmetic progressions, we obtain an upper bound for b(n) asymptotically smaller than n^{1+epsilon} for every fixed epsilon>0.

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