Prof. Emo Welzl and Prof. Bernd Gärtner
|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
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.
Automatic MiSe System Software Version 1.4803M | admin login