Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 22, 2012, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Joshua Zahl (University of California, Los Angeles)
The Szemerédi-Trotter theorem bounds the number of incidences that can occur between a collection of points and lines in the plane. One proof of this theorem uses the crossing number inequality for graphs, while another uses the polynomial ham sandwich theorem. We combine ideas from both of these proofs to obtain a version of the Szemerédi-Trotter theorem for points and 2-planes in R4, provided that the ratio of points and 2-planes satisfy certain restrictions.
Automatic MiSe System Software Version 1.4803M | admin login