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 28, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Shakhar Smorodinsky

A Survey about Geometric Permutations

Let S be a family of convex sets in Rd. A line l is said to be a transversal for S if it intersects every member of S. If S is finite and consists of pairwise-disjoint convex sets, then a line transversal for S induces two linear orderings on S --- the two orders in which the members of S are met by l, corresponding to the two orientations of l.

Such orderings of S are called geometric permutations. How many geometric permutations can a given family, of n pairwise disjoint convex sets, have? This is one of the most challenging open problems in transversal theory. In this talk we survey some recent progress in this area.

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