We are having our first math department colloquium on Thursday, February 16 on the Szemerédi-Trotter theorem, which is a really cool theorem in combinatorial geometry that gives an upper bound on the number of incidences between lines and points in the plane.
Who: Professor Zeev Dvir
What: The Szemerédi–Trotter theorem
When: Thursday at 4:30
Where: Fine 110
Food: Yes (Pizza from Princeton Pi)