Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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: OAT S15/S16/S17
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.
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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
