Talks
Fall 2013

Incidence Geometry and Applications to Theoretical Computer Science

Thursday, Dec. 5, 2013 1:45 pm2:30 pm PST

The classical Sylvester-Gallai Theorem states the following: given a finite set of points in the Euclidean plane, if the line through every pair of points passes through a third point, then all the points must be collinear. At a high level the result shows that many local" linear dependencies implies a global" bound on the dimension of the entire set of points. This result has been well studied in mathematics. In recent years variants of the theorem have also found applications to several structural results in theoretical computer science.