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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, September 23, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Micha Sharir (Tel Aviv Univ.)

On Empty Convex Polygons in a Planar Point Set

Let P be a set of n points in general position in the plane. Let Xk(P) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, several equalities and inequalities involving the quantities Xk(P) and several related quantities. Most of these equalities and inequalities are new, except for a few that have been proved earlier using a considerably more complex machinery from matroid and polytope theory, algebraic topology and commutative algebra.

Some of these relationships are also extended to higher dimensions. We present several implications of these relationships, and discuss their connection with several long-standing open problems, the most notorious of which is the existence of an empty convex hexagon in any point set with sufficiently many points.

(Joint work with Rom Pinchasi and Rados Radoicic)


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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